The mixing time for simple exclusion

DOI10.1214/105051605000000728zbMATH Open1133.60037arXivmath/0405157OpenAlexW3099188142MaRDI QIDQ997944FDOQ997944

Authors: Ben Morris 

Publication date: 8 August 2007

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We obtain a tight bound of $O(L^{2}logk)$ for the mixing time of the exclusion process in $mathbf{Z}^d/Lmathbf{Z}^d$ with $kleq1/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}logd)$ 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.

Full work available at URL: https://arxiv.org/abs/math/0405157

Recommendations

• Cutoff phenomenon for the simple exclusion process on the complete graph
• The spectrum and convergence rates of exclusion and interchange processes on the complete graph
• Mixing times of lozenge tiling and card shuffling Markov chains
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Cutoff for the noisy voter model
• 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 exclusion process mixes (almost) faster than independent particles
• Sampling the Fermi statistics and other conditional product measures
• Mixing times for the rook's walk via path coupling

zbMATH Keywords

relaxation timeexclusion processcontinuous time Markov chainmixing-time

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Mixing times of lozenge tiling and card shuffling Markov chains
• Logarithmic Sobolev inequality for generalized simple exclusion processes
• Logarithmic Sobolev inequalities for finite Markov chains
• Comparison theorems for reversible Markov chains
• Diffusion of color in the simple exclusion process
• Logarithmic Sobolev inequality for some models of random walks
• Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
• Hydrodynamics and large deviation for simple exclusion processes
• Evolving sets, mixing and heat kernel bounds
• Mixing times of the biased card shuffling and the asymmetric exclusion process
• Spectral gap and logarithmic Sobolev inequality for Kawasaki and Glauber dynamics
• Quantum Heisenberg ferromagnets and stochastic exclusion processes
• On the spectral gap of Kawasaki dynamics under a mixing condition revisited

Cited In (20)

• Mixing of permutations by biased transpositions
• Title not available (Why is that?)
• Universality of cutoff for exclusion with reservoirs
• Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
• Entry times distribution for mixing systems
• Mixing time and cutoff for the weakly asymmetric simple exclusion process
• Comparing with octopi
• Cutoff for the non reversible SSEP with reservoirs
• Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
• The exclusion process mixes (almost) faster than independent particles
• On the blockage problem and the non-analyticity of the current for parallel TASEP on a ring
• Mixing time of \(A+B\to 0\) in one dimension
• The probability of long cycles in interchange processes
• Mixing of the averaging process and its discrete dual on finite-dimensional geometries
• Mixing time for the repeated balls into bins dynamics
• A sharp log-Sobolev inequality for the multislice
• Mixing times for the interchange process
• Mixing times for exclusion processes on hypergraphs
• Mixing time and cutoff for one-dimensional particle systems
• Mixing time for the asymmetric simple exclusion process in a random environment

This page was built for publication: The mixing time for simple exclusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997944)