Representation theory and cycle statistics for random walks on the symmetric group

We use representation theory of $S_n$ to analyze the mixing of permutation cycle type statistics $a_j(σ) = ${# of $j$-cycles of $σ$} for any fixed $j$ and $σ$ resulting from a random $i$-cycle walk on $S_n$. We also derive analogous results for the random star transposition walk. Our approach uses the method of moments; a key ingredient is a new formula for the coefficients in the irreducible character decomposition of the $S_n$-class function $(a_j)^r(σ)={(\text{# of $j$-cycles of $σ$})^r}$ for any positive integers $r,j$ when $n\geq 2rj$.

💡 Research Summary

The paper investigates the distribution of cycle‑type statistics for permutations generated by two simple random walks on the symmetric group (S_n): the random (i)-cycle walk and the random star‑transposition walk. For a fixed integer (j\ge1) the statistic of interest is
\