The simplest nearest-neighbor spin system on regular graphs:Time dynamics of the mean coverage function

Details The simplest nearest-neighbor spin system on regular graphs:Time dynamics of the mean coverage function The simplest nearest-neighbor spin system on regular graphs:Time dynamics of the mean coverage function

2002-07-24

arxiv.org/abs/math/0207217v1

Published in: Markov Processes Relat.Fields,8,527-546(2002)

Mathematics

Probability

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The simplest nearest-neighbor spin system on regular graphs:Time dynamics of the mean coverage function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The simplest nearest-neighbor spin system on regular graphs:Time dynamics of the mean coverage function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The simplest nearest-neighbor spin system on regular graphs:Time dynamics of the mean coverage function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-293950