The Annals of Probability

Cutoff for the mean-field zero-range process

Mathieu Merle and Justin Salez

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We study the mixing time of the unit-rate zero-range process on the complete graph, in the regime where the number $n$ of sites tends to infinity while the density of particles per site stabilizes to some limit $\rho >0$. We prove that the worst-case total-variation distance to equilibrium drops abruptly from $1$ to $0$ at time $n(\rho +\frac{1}{2}\rho^{2})$. More generally, we determine the mixing time from an arbitrary initial configuration. The answer turns out to depend on the largest initial heights in a remarkably explicit way. The intuitive picture is that the system separates into a slowly evolving solid phase and a quickly relaxing liquid phase. As time passes, the solid phase dissolves into the liquid phase, and the mixing time is essentially the time at which the system becomes completely liquid. Our proof combines metastability, separation of timescales, fluid limits, propagation of chaos, entropy and a spectral estimate by Morris (Ann. Probab. 34 (2006) 1645–1664).

Article information

Source
Ann. Probab., Volume 47, Number 5 (2019), 3170-3201.

Dates
Received: April 2018
First available in Project Euclid: 22 October 2019

Permanent link to this document
https://projecteuclid.org/euclid.aop/1571731448

Digital Object Identifier
doi:10.1214/19-AOP1336

Mathematical Reviews number (MathSciNet)
MR4021248

Zentralblatt MATH identifier
07145314

Subjects
Primary: 60J27: Continuous-time Markov processes on discrete state spaces 37A25: Ergodicity, mixing, rates of mixing 82C22: Interacting particle systems [See also 60K35]

Keywords
Zero-range process cutoff phenomenon

Citation

Merle, Mathieu; Salez, Justin. Cutoff for the mean-field zero-range process. Ann. Probab. 47 (2019), no. 5, 3170--3201. doi:10.1214/19-AOP1336. https://projecteuclid.org/euclid.aop/1571731448


Export citation

References

  • [1] Aldous, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. In Seminar on Probability, XVII. Lecture Notes in Math. 986 243–297. Springer, Berlin.
  • [2] Aldous, D. and Diaconis, P. (1986). Shuffling cards and stopping times. Amer. Math. Monthly 93 333–348.
  • [3] Amann, H. (1990). Ordinary Differential Equations: An Introduction to Nonlinear Analysis. de Gruyter, Berlin. Translated from the German by Gerhard Metzen.
  • [4] Caputo, P. and Posta, G. (2007). Entropy dissipation estimates in a zero-range dynamics. Probab. Theory Related Fields 139 65–87.
  • [5] Cover, T. M. and Thomas, J. A. (2006). Elements of Information Theory, 2nd ed. Wiley Interscience, Hoboken, NJ.
  • [6] Diaconis, P. (1996). The cutoff phenomenon in finite Markov chains. Proc. Natl. Acad. Sci. USA 93 1659–1664.
  • [7] Diaconis, P. and Shahshahani, M. (1981). Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete 57 159–179.
  • [8] Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
  • [9] Evans, M. R. (2000). Phase transitions in one-dimensional nonequilibrium systems. Braz. J. Phys. 30 42.
  • [10] Evans, M. R. and Hanney, T. (2005). Nonequilibrium statistical mechanics of the zero-range process and related models. J. Phys. A 38 R195–R240.
  • [11] Ganguly, S., Lubetzky, E. and Martinelli, F. (2015). Cutoff for the East process. Comm. Math. Phys. 335 1287–1322.
  • [12] Graham, B. T. (2009). Rate of relaxation for a mean-field zero-range process. Ann. Appl. Probab. 19 497–520.
  • [13] Lacoin, H. (2016). The cutoff profile for the simple exclusion process on the circle. Ann. Probab. 44 3399–3430.
  • [14] Lacoin, H. (2016). Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion. Ann. Probab. 44 1426–1487.
  • [15] Lacoin, H. (2017). The simple exclusion process on the circle has a diffusive cutoff window. Ann. Inst. Henri Poincaré Probab. Stat. 53 1402–1437.
  • [16] Lacoin, H. and Leblond, R. (2011). Cutoff phenomenon for the simple exclusion process on the complete graph. ALEA Lat. Am. J. Probab. Math. Stat. 8 285–301.
  • [17] Levin, D. A., Luczak, M. J. and Peres, Y. (2010). Glauber dynamics for the mean-field Ising model: Cut-off, critical power law, and metastability. Probab. Theory Related Fields 146 223–265.
  • [18] Levin, D. A., Peres, Y. and Wilmer, E. L. (2017). Markov Chains and Mixing Times. Amer. Math. Soc., Providence, RI.
  • [19] Lubetzky, E. and Sly, A. (2013). Cutoff for the Ising model on the lattice. Invent. Math. 191 719–755.
  • [20] Lubetzky, E. and Sly, A. (2014). Cutoff for general spin systems with arbitrary boundary conditions. Comm. Pure Appl. Math. 67 982–1027.
  • [21] Montenegro, R. and Tetali, P. (2006). Mathematical aspects of mixing times in Markov chains. Found. Trends Theor. Comput. Sci. 1 x+121.
  • [22] Morris, B. (2006). Spectral gap for the zero range process with constant rate. Ann. Probab. 34 1645–1664.
  • [23] Spitzer, F. (1970). Interaction of Markov processes. Adv. Math. 5 246–290.
  • [24] Sznitman, A.-S. (1991). Topics in propagation of chaos. In École D’Été de Probabilités de Saint-Flour XIX—1989. Lecture Notes in Math. 1464 165–251. Springer, Berlin.