Mixing of the exclusion process with small bias
From MaRDI portal
(Redirected from Publication:513198)
Abstract: We analyze the mixing behavior of the biased exclusion process on a path of length as the bias tends to as . We show that the sequence of chains has a pre-cutoff, and interpolates between the unbiased exclusion and the process with constant bias. As the bias increases, the mixing time undergoes two phase transitions: one when is of order , and the other when is order .
Recommendations
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Mixing times for the simple exclusion process in ballistic random environment
- Mixing times for the simple exclusion process with open boundaries
- Mixing time and cutoff for the weakly asymmetric simple exclusion process
- Exclusion processes with multiple interactions
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- EXCLUSION PROCESSES AND BOUNDARY CONDITIONS
- Exclusion process with slow boundary
- scientific article; zbMATH DE number 5202448
- The asymmetric exclusion process and Brownian excursions
Cites work
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- Glauber dynamics on the cycle is monotone
- scientific article; zbMATH DE number 3812655 (Why is no real title available?)
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- 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
- Sampling biased lattice configurations using exponential metrics
Cited in
(12)- Metastability for expanding bubbles on a sticky substrate
- Cutoff profile of ASEP on a segment
- The exclusion process mixes (almost) faster than independent particles
- Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
- Mixing times for the simple exclusion process in ballistic random environment
- Mixing time and cutoff for the weakly asymmetric simple exclusion process
- Sampling biased monotonic surfaces using exponential metrics
- Mixing times of Markov chains for self‐organizing lists and biased permutations
- Mixing times for the simple exclusion process with open boundaries
- Mixing time and cutoff for one-dimensional particle systems
- Mixing time for the asymmetric simple exclusion process in a random environment
- Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
This page was built for publication: Mixing of the exclusion process with small bias
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513198)