The mixing time for simple exclusion

Abstract

We obtain a tight bound of $O(L^2\log k)$ for the mixing time of the exclusion process in ${\mathbf{Z}}^d/L{\mathbf{Z}}^d$ with $k\le 1/2L^d$ particles. Previously the best bound, based on the log Sobolev constant determined by Yau, was not tight for small $k$. When dependence on the dimension $d$ is considered, our bounds are an improvement for all $k$. We also get bounds for the relaxation time that are lower order in $d$ than previous estimates: our bound of $O(L^2\log d)$ improves on the earlier bound $O(L^{2}d)$ obtained by Quastel. Our proof is based on an auxiliary Markov chain we call the chameleon process, which may be of independent interest.

Published at http://dx.doi.org/10.1214/105051605000000728 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (1)

• Mixing times of lozenge tiling and card shuffling Markov chains

Cited by in corpus (6)

• The cutoff profile for the simple exclusion process on the circle
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
• The probability of long cycles in interchange processes
• On the blockage problem and the non-analyticity of the current for the parallel TASEP on a ring
• Mixing time for the asymmetric simple exclusion process in a random environment