Open Access
May 2006 The mixing time for simple exclusion
Ben Morris
Ann. Appl. Probab. 16(2): 615-635 (May 2006). DOI: 10.1214/105051605000000728

Abstract

We obtain a tight bound of O(L2logk) for the mixing time of the exclusion process in Zd/LZd with k≤½Ld 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(L2logd) improves on the earlier bound O(L2d) obtained by Quastel. Our proof is based on an auxiliary Markov chain we call the chameleon process, which may be of independent interest.

Citation

Download Citation

Ben Morris. "The mixing time for simple exclusion." Ann. Appl. Probab. 16 (2) 615 - 635, May 2006. https://doi.org/10.1214/105051605000000728

Information

Published: May 2006
First available in Project Euclid: 29 June 2006

zbMATH: 1133.60037
MathSciNet: MR2244427
Digital Object Identifier: 10.1214/105051605000000728

Subjects:
Primary: 60J05

Keywords: Exclusion process , Markov chain , mixing time

Rights: Copyright © 2006 Institute of Mathematical Statistics

Vol.16 • No. 2 • May 2006
Back to Top