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

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-293950

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.