A strong stationary time for random transpositions

arXiv1910.00770MaRDI QIDQ6326372FDOQ6326372

Authors: Graham White 

Publication date: 2 October 2019

Abstract: We show that the random transposition walk on the symmetric group $S_n$ has cutoff in separation distance at $frac12nlogn$, by constructing a strong stationary time. The construction involves working with cycle types of permutations and some partition combinatorics.

This page was built for publication: A strong stationary time for random transpositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326372)