arXiv Analytics

Sign in

arXiv:math/0405157 [math.PR]AbstractReferencesReviewsResources

The mixing time for simple exclusion

Ben Morris

Published 2004-05-10, updated 2006-07-12Version 2

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\leq{1/2}L^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^2d)$ obtained by Quastel. Our proof is based on an auxiliary Markov chain we call the chameleon process, which may be of independent interest.

Comments: 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)
Journal: Annals of Applied Probability 2006, Vol. 16, No. 2, 615-635
Categories: math.PR, math-ph, math.MP
Subjects: 60J05
Related articles: Most relevant | Search more
arXiv:math/0307336 [math.PR] (Published 2003-07-25)
Glauber dynamics on trees:Boundary conditions and mixing time
arXiv:0712.0489 [math.PR] (Published 2007-12-04, updated 2008-11-10)
Glauber dynamics on nonamenable graphs: Boundary conditions and mixing time
arXiv:1903.07311 [math.PR] (Published 2019-03-18)
Stochastic homogenization in amorphous media and applications to exclusion processes