Mean and variance of the distance in the modified bubble-sort graph
Year: 2026
Type: article
Abstract: We study the minimum number of cyclically adjacent swaps needed to sort a uniformly random permutation in $S_n$, equivalently its distance from the identity in the modified bubble-sort graph. We prove that the mean is $\frac{n^2-n+1}{6}$ for $n\ge2$, establishing the formula observed in computations by Kuznetsov and collaborators. We determine the variance as $\frac{n^3+2n^2+7n+21}{180}$ for $n\ge4$ and prove that the centred and scaled distance converges to a standard normal law, settling the CayleyPy project's Gaussian-limit conjecture for cyclic Coxeter generators. Finally, we show that the $r$-th moment is a polynomial in $n$ of degree $2r$ for $n\ge2r+1$.
Author: Schiavo, Vasco
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235414959
