The exclusion process mixes (almost) faster than independent particles
From MaRDI portal
Publication:2212617
DOI10.1214/20-AOP1455zbMath1476.60133arXiv1808.10846OpenAlexW3093663298MaRDI QIDQ2212617
Richard Pymar, Jonathan Hermon
Publication date: 24 November 2020
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.10846
Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (9)
Mixing times for the simple exclusion process in ballistic random environment ⋮ Rapid social connectivity ⋮ Mixing times for the simple exclusion process with open boundaries ⋮ Universality of cutoff for exclusion with reservoirs ⋮ Unnamed Item ⋮ The interchange process on high-dimensional products ⋮ Comparing with octopi ⋮ A finitary structure theorem for vertex-transitive graphs of polynomial growth ⋮ A sharp log-Sobolev inequality for the multislice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- The cutoff profile for the simple exclusion process on the circle
- Mixing of the exclusion process with small bias
- Nash inequalities for finite Markov chains
- Interacting particle systems. With a new postface.
- Mixing time bounds via the spectral profile
- Nilprogressions and groups with moderate growth
- The mixing time for simple exclusion
- A note on percolation on \(\mathbb Z^d\): isoperimetric profile via exponential cluster repulsion
- Ends in uniform spanning forests
- Logarithmic Sobolev inequality for some models of random walks
- Comparison theorems for reversible Markov chains
- Moderate growth and random walk on finite groups
- Logarithmic Sobolev inequality for generalized simple exclusion processes
- Mixing times of lozenge tiling and card shuffling Markov chains
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Mixing times for exclusion processes on hypergraphs
- A version of Aldous' spectral-gap conjecture for the zero range process
- A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- A product chain without cutoff
- Logarithmic Sobolev inequalities for finite Markov chains
- Evolving sets, mixing and heat kernel bounds
- Rapid social connectivity
- On the spectral gap of Kawasaki dynamics under a mixing condition revisited
- Cutoff phenomenon for the simple exclusion process on the complete graph
- Mixing times for the interchange process
- Negative dependence and the geometry of polynomials
- Proof of Aldous’ spectral gap conjecture
- On the precision of the spectral profile
- Hydrodynamics and large deviation for simple exclusion processes
- Diffusion of color in the simple exclusion process
- Sensitivity of Mixing Times in Eulerian Digraphs
- Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
This page was built for publication: The exclusion process mixes (almost) faster than independent particles
