Cutoff for the Adjacent Transposition Shuffle on a Cycle

Source abstract

In the adjacent transposition shuffle on a cycle, $n$ distinct cards are placed at the vertices of a cycle, and adjacent cards swap positions according to independent Poisson clocks of rate 1. We prove that this Markov chain exhibits total variation cutoff at time $n^2\log n/(8π^2)$, with a window of order at most $n^2\log\log n$.