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.

Mark Helpful

Bookmark

Relay

View Full Paper

Mark Helpful

Bookmark

Relay

View Full Paper

Cite This Study

Lucas Teyssier (Tue,) studied this question.

synapsesocial.com/papers/69dcc32d89c4deb67d359939 https://doi.org/https://doi.org/10.1214/20-aop1424

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Linear Representations of Finite Groups1977 · 2,404 citations
2Asymptotic Representation Theory of the Symmetric Group and its Applications in Analysis2003 · 197 citations
3Markov Chains and Mixing Times2008 · 2,337 citations
4On Trees and Characters2003 · 11 citations
5Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group2005 · 29 citations

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Linear Representations of Finite Groups1977 · 2,404 citations
2Asymptotic Representation Theory of the Symmetric Group and its Applications in Analysis2003 · 197 citations
3Markov Chains and Mixing Times2008 · 2,337 citations
4On Trees and Characters2003 · 11 citations
5Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group2005 · 29 citations