Mixing times for the simple exclusion process in ballistic random environment
From MaRDI portal
Publication:2631847
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.
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
Cites work
- scientific article; zbMATH DE number 5354339 (Why is no real title available?)
- scientific article; zbMATH DE number 3604123 (Why is no real title available?)
- scientific article; zbMATH DE number 1350307 (Why is no real title available?)
- scientific article; zbMATH DE number 2070282 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- Can extra updates delay mixing?
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- Cutoff and mixing time for transient random walks in random environments
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- Exact solution of a partially asymmetric exclusion model using a deformed oscillator algebra
- Extremal reversible measures for the exclusion process
- Mixing of the exclusion process with small bias
- 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
- Mixing times of lozenge tiling and card shuffling Markov chains
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- Random walks in a random environment
- Rapid mixing of \(k\)-class biased permutations
- The exclusion process mixes (almost) faster than independent particles
Cited in
(12)- Metastability for expanding bubbles on a sticky substrate
- Mixing times for the mean-field Blume-Capel model via aggregate path coupling
- Mixing of the averaging process and its discrete dual on finite-dimensional geometries
- Mixing time for the repeated balls into bins dynamics
- 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 times for exclusion processes on hypergraphs
- Mixing times for the TASEP in the maximal current phase
- Mixing time for the asymmetric simple exclusion process in a random environment
- Mixing of the exclusion process with small bias
- Mixing time and cutoff for one-dimensional particle systems
- Mixing time of \(A+B\to 0\) in one dimension
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)