A strong stationary time for random transpositions
Abstract
We show that the random transposition walk on the symmetric group Sn has cutoff in separation distance at 12n n, by constructing a strong stationary time. The construction involves working with cycle types of permutations and some partition combinatorics.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.