## The Annals of Probability

### Mixing times for a constrained Ising process on the torus at low density

#### Abstract

We study a kinetically constrained Ising process (KCIP) associated with a graph $G$ and density parameter $p$; this process is an interacting particle system with state space $\{0,1\}^{G}$, the location of the particles. The number of particles at stationarity follows the $\operatorname{Binomial}(|G|,p$) distribution, conditioned on having at least one particle. The “constraint” in the name of the process refers to the rule that a vertex cannot change its state unless it has at least one neighbour in state “1”. The KCIP has been proposed by statistical physicists as a model for the glass transition, and more recently as a simple algorithm for data storage in computer networks. In this note, we study the mixing time of this process on the torus $G=\mathbb{Z}_{L}^{d}$, $d\geq3$, in the low-density regime $p=\frac{c}{|G|}$ for arbitrary $0<c<\infty$; this regime is the subject of a conjecture of Aldous and is natural in the context of computer networks. Our results provide a counterexample to Aldous’ conjecture, suggest a natural modification of the conjecture, and show that this modification is correct up to logarithmic factors. The methods developed in this paper also provide a strategy for tackling Aldous’ conjecture for other graphs.

#### Article information

Source
Ann. Probab., Volume 45, Number 2 (2017), 1003-1070.

Dates
Revised: November 2015
First available in Project Euclid: 31 March 2017

https://projecteuclid.org/euclid.aop/1490947313

Digital Object Identifier
doi:10.1214/15-AOP1080

Mathematical Reviews number (MathSciNet)
MR3630292

Zentralblatt MATH identifier
1381.60105

#### Citation

Pillai, Natesh S.; Smith, Aaron. Mixing times for a constrained Ising process on the torus at low density. Ann. Probab. 45 (2017), no. 2, 1003--1070. doi:10.1214/15-AOP1080. https://projecteuclid.org/euclid.aop/1490947313

#### References

• [1] Aldous, D. Open Problem List. http://www.stat.berkeley.edu/~aldous/Research/OP/. Accessed: 2014-12-18.
• [2] Aldous, D. and Diaconis, P. (2002). The asymmetric one-dimensional constrained Ising model: Rigorous results. J. Stat. Phys. 107 945–975.
• [3] Cancrini, N., Martinelli, F., Roberto, C. and Toninelli, C. (2009). Kinetically constrained models. New Trends in Mathematical Physics 741–752.
• [4] Chleboun, P., Faggionato, A. and Martinelli, F. (2014). Time scale separation and dynamic heterogeneity in the low temperature East model. Comm. Math. Phys. 328 955–993.
• [5] Chleboun, P., Faggionato, A. and Martinelli, F. (2015). Mixing time and local exponential ergodicity of the East-like process in $\mathbb{Z}^{d}$. Ann. Fac. Sci. Toulouse Math. (6) 24 717–743.
• [6] Chleboun, P., Faggionato, A. and Martinelli, F. (2016). Relaxation to equilibrium of generalized East processes on $\mathbb{Z}^{d}$: Renormalization group analysis and energy-entropy competition. Ann. Probab. 44 1817–1863.
• [7] Chleboun, P. and Martinelli, F. (2013). Mixing time bounds for oriented kinetically constrained spin models. Electron. Commun. Probab. 18 no. 60, 9.
• [8] Clifford, P. and Sudbury, A. (1973). A model for spatial conflict. Biometrika 60 581–588.
• [9] Cox, J. T. (1989). Coalescing random walks and voter model consensus times on the torus in $\mathbb{Z}^{d}$. Ann. Probab. 17 1333–1366.
• [10] Diaconis, P. and Saloff-Coste, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696–730.
• [11] Diaconis, P. and Saloff-Coste, L. (1996). Logarithmic Sobolev inequalities for finite Markov chains. Ann. Appl. Probab. 6 695–750.
• [12] Dyer, M., Goldberg, L. A., Jerrum, M. and Martin, R. (2006). Markov chain comparison. Probab. Surv. 3 89–111.
• [13] Fredrickson, G. and Andersen, H. (1984). Kinetic Ising model of the glass transition. Phys. Rev. Lett. 53 1244–1247.
• [14] Fredrickson, G. and Andersen, H. (1985). Facilitated kinetic Ising models and the glass transition. J. Chem. Phys. 83 5822–5831.
• [15] Ganguly, S., Lubetzky, E. and Martinelli, F. (2015). Cutoff for the East process. Comm. Math. Phys. 335 1287–1322.
• [16] Garrahan, J., Sollich, P. and Toninelli, C. (2011). Dynamical Heterogeneities in Glasses, Colloids and Granular Media. Oxford Univ. Press, London.
• [17] Holley, R. A. and Liggett, T. M. (1975). Ergodic theorems for weakly interacting infinite systems and the voter model. Ann. Probab. 3 643–663.
• [18] Hoory, S., Linial, N. and Wigderson, A. (2006). Expander graphs and their applications. Bull. Amer. Math. Soc. (N.S.) 43 439–561 (electronic).
• [19] Jack, R. L., Mayer, P. and Sollich, P. (2006). Mappings between reaction–diffusion and kinetically constrained systems: $A+A\leftrightarrow A$ and the Fredrickson–Andersen model have upper critical dimension $d_{c}=2$. J. Stat. Mech. Theory Exp. 2006 P03006.
• [20] Jerrum, M., Son, J.-B., Tetali, P. and Vigoda, E. (2004). Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains. Ann. Appl. Probab. 14 1741–1765.
• [21] Kordzakhia, G. and Lalley, S. P. (2006). Ergodicity and mixing properties of the northeast model. J. Appl. Probab. 43 782–792.
• [22] Levin, D. A., Peres, Y. and Wilmer, E. L. (2009). Markov Chains and Mixing Times. Amer. Math. Soc., Providence, RI.
• [23] Martinelli, F. (2014). East model: Mixing time, cutoff and dynamical heterogeneities. Lecture (Slides at http://www2.warwick.ac.uk/fac/sci/maths/research/events/2013-2014/nonsymp/gscsd/programme/fabio-slides.pdf).
• [24] Martinelli, F. and Toninelli, C. (2013). Kinetically constrained spin models on trees. Ann. Appl. Probab. 23 1967–1987.
• [25] Oliveira, R. I. (2012). Mixing and hitting times for finite Markov chains. Electron. J. Probab. 17 no. 70, 12.
• [26] Oliveira, R. I. (2012). On the coalescence time of reversible random walks. Trans. Amer. Math. Soc. 364 2109–2128.
• [27] Oliveira, R. I. (2013). Mean field conditions for coalescing random walks. Ann. Probab. 41 3420–3461.
• [28] Peres, Y. and Sousi, P. (2013). Mixing times are hitting times of large sets. J. Theoret. Probab. 9 459–510.
• [29] Pillai, N. and Smith, A. (2015). Elementary bounds on mixing times for decomposable Markov chains. Preprint. Available at arXiv:1507.04028.
• [30] Smith, A. (2015). Comparison theory for Markov chains on different state spaces and application to random walk on derangements. J. Theoret. Probab. 28 1406–1430.
• [31] Valiant, P. (2004). Linear bounds on the North–East model and higher-dimensional analogs. Adv. in Appl. Math. 33 40–50.
• [32] Yau, H.-T. (1997). Logarithmic Sobolev inequality for generalized simple exclusion processes. Probab. Theory Related Fields 109 507–538.