Attractive nearest-neighbor spin systems on the integers in a randomly evolving environment

Details Attractive nearest-neighbor spin systems on the integers in a randomly evolving environment Attractive nearest-neighbor spin systems on the integers in a randomly evolving environment

2007-12-18

arxiv.org/abs/0712.2929v2

Mathematics

Probability

14 pages

Scientific paper

We consider spin systems on $\Z$ (i.e.\ interacting particle systems on $\Z$ in which each coordinate only has two possible values and only one coordinate changes in each transition) whose rates are determined by another process, called a background process. A canonical example is the so called contact process in randomly evolving environment (CPREE), introduced and analysed by E. Broman and furthermore studied by J. Steif and the author, where the marginals of the background process independently evolve as 2-state Markov chains and determine the recovery rates for a contact process. We prove that under certain conditions on the rates there are at most two extremal stationary distributions. The proof follows closely the ideas of Liggett's proof of a corresponding theorem for spin systems on $\Z$ without a background process.

Affiliated with

Also associated with

No associations

Rating

Attractive nearest-neighbor spin systems on the integers in a randomly evolving environment 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 Attractive nearest-neighbor spin systems on the integers in a randomly evolving environment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Attractive nearest-neighbor spin systems on the integers in a randomly evolving environment will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549288