A strong stationary time for random transpositions
Probability
2019-10-03 v1 Combinatorics
Abstract
We show that the random transposition walk on the symmetric group has cutoff in separation distance at , by constructing a strong stationary time. The construction involves working with cycle types of permutations and some partition combinatorics.
Keywords
Cite
@article{arxiv.1910.00770,
title = {A strong stationary time for random transpositions},
author = {Graham White},
journal= {arXiv preprint arXiv:1910.00770},
year = {2019}
}