Mixing times for the simple exclusion process in ballistic random environment
From MaRDI portal
Publication:2631847
DOI10.1214/19-EJP286zbMATH Open1412.60137arXiv1806.03937MaRDI QIDQ2631847FDOQ2631847
Authors: Dominik Schmid
Publication date: 16 May 2019
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Abstract: We consider the exclusion process on segments of the integers in a site-dependent random environment. We assume to be in the ballistic regime in which a single particle has positive linear speed. Our goal is to study the mixing time of the exclusion process when the number of particles is linear in the size of the segment. We investigate the order of the mixing time depending on the support of the environment distribution. In particular, we prove for nestling environments that the order of the mixing time is different than in the case of a single particle.
Full work available at URL: https://arxiv.org/abs/1806.03937
Recommendations
- The mixing time for 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
- Mixing of the exclusion process with small bias
- The simple exclusion process on the circle has a diffusive cutoff window
Continuous-time Markov processes on discrete state spaces (60J27) Processes in random environments (60K37)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random walks in a random environment
- 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 time and cutoff for the adjacent transposition shuffle and the simple exclusion
- Can extra updates delay mixing?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Title not available (Why is that?)
- Extremal reversible measures for the exclusion process
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- Mixing of the exclusion process with small bias
- Exact solution of a partially asymmetric exclusion model using a deformed oscillator algebra
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- The exclusion process mixes (almost) faster than independent particles
- Cutoff and mixing time for transient random walks in random environments
- Rapid mixing of \(k\)-class biased permutations
Cited In (11)
- Mixing times and cutoff for the TASEP in the high and low density phase
- Mixing times for the simple exclusion process with open boundaries
- Mixing time of \(A+B\to 0\) in one dimension
- Mixing of the averaging process and its discrete dual on finite-dimensional geometries
- Mixing times for the mean-field Blume-Capel model via aggregate path coupling
- Mixing time for the repeated balls into bins dynamics
- Mixing times for the TASEP in the maximal current phase
- Mixing of the exclusion process with small bias
- Mixing time and cutoff for one-dimensional particle systems
- Metastability for expanding bubbles on a sticky substrate
- Mixing time for the asymmetric simple exclusion process in a random environment
This page was built for publication: Mixing times for the simple exclusion process in ballistic random environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631847)