Limit profile for random transpositions
Author:
- Lucas TeyssierLTLucas Teyssier
- 1 September 2020
- journal article
- research article
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 48 (5) , 2323-2343
Abstract
We present an improved version of Diaconis–Shahshahani upper bound lemma, which is used to compute the limiting value of the distance to stationarity. We then apply it to the random transposition shuffle.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- The cutoff profile for the simple exclusion process on the circleThe Annals of Probability, 2016
- Random generators of the symmetric group: Diameter, mixing time and spectral gapJournal of Algebra, 2015
- Mixing times for random k-cycles and coalescence-fragmentation chainsThe Annals of Probability, 2011
- Markov Chains and Mixing Times2008
- Compositions of random transpositionsIsrael Journal of Mathematics, 2005
- Rapidly Mixing Random Walks and Bounds on Characters of the Symmetric GroupJournal of Algebraic Combinatorics, 2002
- Trailing the Dovetail Shuffle to its LairThe Annals of Applied Probability, 1992
- A strong uniform time for random transpositionsJournal of Theoretical Probability, 1988
- Generating a random permutation with random transpositionsProbability Theory and Related Fields, 1981
- Linear Representations of Finite Groups1977