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

@inproceedings{Lulov2001RapidlyMR,
  title={Rapidly Mixing Random Walks and Bounds on Characters of the Symmetric Group},
  author={Nathan Lulov and Igor Pak},
  year={2001}
}
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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Random Walks on the Symmetric Group Generated by Conjugacy Classes,

N. Lulov
Ph.D. Thesis, Harvard University, • 1996
View 10 Excerpts
Highly Influenced

The cutoff phenomenon in finite Markov chains.

Proceedings of the National Academy of Sciences of the United States of America • 1996
View 4 Excerpts
Highly Influenced

Group Representations in Probability and Statistics, IMS

P. Diaconis
Hayward, California, • 1988
View 10 Excerpts
Highly Influenced

Generating a random permutation with random transpositions,

P. Diaconis, M. Shahshahani
Z. Wahr. verw. Gebiete, • 1981
View 7 Excerpts
Highly Influenced

Mixing Times, AMS DIMACS Series, Vol

L. Lovász, P. Winkler
41, pp. 189–204, • 1998
View 1 Excerpt

and J

D. Aldou
Fill, Reversible Markov Chains and Random Walks on Graphs, monograph in preparation, • 1996
View 3 Excerpts

Cayley Graphs: Eigenvalues, Expanders and Random Walks, LMS

A. Lubotzky
Lecture Note Ser., • 1995
View 1 Excerpt

Similar Papers

Loading similar papers…