arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0405157math.PRmath-phmath.MP

The mixing time for simple exclusion

Ben Morris

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑