Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
By Cyril Labbé, H. Lacoin. Annals of Probability, 2016
53 citations recorded by the source corpus.
We consider the biased card shuffling and the Asymmetric Simple Exclusion Process (ASEP) on the segment. We obtain the asymptotic of their mixing times, thus showing that these two continuous-time Markov chains display cutoff. Our analysis combines several ingredients including: a study of the hydrodynamic profile for ASEP, the use of monotonic eigenfunction, stochastic comparisons and concentration inequalities.
Subfields: Management Information Systems, Mathematical Physics, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/9ef5caa3365759a6eed12cf2edb5ed4e18e8f549
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Mathematical Physics
- David A. Levin
- Yuval Peres
- Pablo Shmerkin
- Michael Hochman
- M. Kassmann
- Takashi Kumagai
- Alexander E. Holroyd
- Jonathan M. Fraser
In Statistics and Probability
- David A. Levin
- Yuval Peres
- Manjunath Krishnapur
- M. Kassmann
- Takashi Kumagai
- Terence Tao
- Zhen-Qing Chen
- Charles Bordenave
Citations in the corpus
- Markov Chains and Mixing Times: Second Edition (2017, background): “Notes As mentioned in the Notes of Chapter 16, Wilson first proved a pre-cutoff for random adjacent transpositions, showing that 1 ≤ tmix(ε) π−2n3 logn [1 + o(1)] ≤ 2; Lacoin (2016a) proved a cutoff at n(3) log n/(π(2)).”