Rapidly Mixing Random Walks and Bounds on Characters of the Symmetric Group

Authors:
Nathan Lulov;Igor Pak
Affiliations:
DIMACS Center, Rutgers University, Piscataway, New Jersey, 08855, USA.;Department of Mathematics, MIT, Cambridge, MA 02139, USA.
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
2002

Citing 5
Cited 0

Strong uniform times and finite random walks

Advances in Applied Mathematics
Cayley graphs: eigenvalues, expanders and random walks

Surveys in combinatorics, 1995
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes

Discrete Applied Mathematics
Random walks on the symmetric group generated by conjugacy classes

Random walks on the symmetric group generated by conjugacy classes
Reversal of Markov Chains and the Forget Time

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate mixing of random walks on Sn and An generated by permutations of a given cycle structure. The approach follows methods developed by Diaconis, which requires certain estimates on characters of the symmetric group and uses combinatorics of Young tableaux. We conclude with conjectures and open problems.