The simplest nearest-neighbor spin system on regular graphs:Time dynamics of the mean coverage function
| dc.creator | Granovsky, Boris L. | |
| dc.date | 2002-07-24 | |
| dc.date.accessioned | 2026-07-07T04:49:49Z | |
| dc.date.available | 2026-07-07T04:49:49Z | |
| dc.description | We establish a characterization of the class of the simplest nearest neighbor spin systems possesing the mean coverage function (mcf) that obeys a second order differential equation, and derive explicit expressions for the mcf's of the above models. Based on these expressions, the problem of ergodicity of the models is studied and bounds for their spectral gaps are obtained. | |
| dc.identifier | https://arxiv.org/abs/math/0207217 | |
| dc.identifier | http://arxiv.org/abs/math/0207217 | |
| dc.identifier | Published in: Markov Processes Relat.Fields,8,527-546(2002) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64570 | |
| dc.subject | Probability | |
| dc.subject | 60J27,60K35,82C22 | |
| dc.title | The simplest nearest-neighbor spin system on regular graphs:Time dynamics of the mean coverage function | |
| dc.type | text |