Rapidly mixing random walks and bounds on characters of the symmetric group
The authors investigate mixing of random walks on \(S_n\) and \(A_n\) generated by permutations of a given cycle structure. The approach follows methods developed by P. Diaconis. It requires certain estimates on characters of the symmetric group and uses combinatorics of Young tableaux. Some conjectures and open problems are presented.
scientific article; zbMATH DE number 1879614