Voter model in a random environment in ?d

Abstract

We consider the voter model with flip rates determined by {μ_e, e ∈ E_d}, where E_d is the set of all non-oriented nearest-neighbour edges in the Euclidean lattice {\mathrm{\mathbb{Z}}}^{\mathit{d}}. Suppose that {μ_e, e ∈ E_d} are independent and identically distributed (i.i.d.) random variables satisfying μ_e≥1. We prove that when d = 2, almost surely for all random environments, the voter model has only two extremal invariant measures: δ₀ and δ₁.

Keywords

Voter model / random walk / random environment / duality

References

[1] Barlow M T, Deuschel J-D. Invariance principle for the random conductance model with unbounded conductances. Ann Probab, 2010, 38(1): 234-276

[2] Barlow M T, Peres Y, Sousi P. Collisions of random walks. Preprint, 2010 (http://arxiv.org/abs/1003.3255)

[3] Chen X, Chen D. Two random walks on the open cluster of ℤ2 meet infinitely often. Sci China Math, 2010, 53(8): 1971-1978

[4] Chen X, Chen D. Some sufficient conditions for infinite collisions of simple random walks on a wedge comb. Electron J Probab, 2011, 16: 1341-1355

[5] Delmotte T. Parabolic Harnack inequality and estimates of Markov chains on graphs. Rev Mat Iberoam, 1999, 15: 181-232

[6] Delmotte T, Deuschel J-D. On estimating the derivatives of symmetric diffusions in stationary random environment, with applications to ▿ϕ interface model. Probab Theory Related Fields, 2005, 133: 358-390

[7] Durrett R T. Probability: Theory and Examples. <BibVersion>3rd ed</BibVersion>. Belmont: Brooks/Cole, 2005

[8] Ferreira I. The probability of survival for the biased voter model in a random environment. Stochastic Process Appl, 1990, 34: 25-38

[9] Krishnapur M, Peres Y. Recurrent graphs where two independent random walks collide finitely often. Electron Commun Probab, 2004, 9: 72-81

[10] Liggett T M. Interacting Particle Systems. New York: Springer-Verlag, 1985

RIGHTS & PERMISSIONS

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg