Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
Author:
- Hubert LacoinHLHubert Lacoin
Top Cited Papers
Open Access
- 1 March 2016
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 44 (2) , 1426-1487
Abstract
In this paper, we investigate the mixing time of the adjacent transposition shuffle for a deck of $N$ cards. We prove that around time $N^{2}\log N/(2\pi^{2})$, the total variation distance to equilibrium of the deck distribution drops abruptly from $1$ to $0$, and that the separation distance has a similar behavior but with a transition occurring at time $(N^{2}\log N)/\pi^{2}$. This solves a conjecture formulated by David Wilson. We present also similar results for the exclusion process on a segment of length $N$ with $k$ particles.
Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Can Extra Updates Delay Mixing?Communications in Mathematical Physics, 2013
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walkThe Annals of Probability, 2013
- Mixing times for random k-cycles and coalescence-fragmentation chainsThe Annals of Probability, 2011
- The mixing time for simple exclusionThe Annals of Applied Probability, 2006
- Trailing the Dovetail Shuffle to its LairThe Annals of Applied Probability, 1992
- A strong uniform time for random transpositionsJournal of Theoretical Probability, 1988
- Random walks on finite groups and rapidly mixing markov chains1983
- Generating a random permutation with random transpositionsProbability Theory and Related Fields, 1981
- Remarks on the FKG inequalitiesCommunications in Mathematical Physics, 1974
- Correlation inequalities on some partially ordered setsCommunications in Mathematical Physics, 1971