On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes

Discrete Applied Mathematics

Volumn 110, Issue 2-3, 2001, Pages 251-272

  Pak, Igor ^a   Vu, Van H ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Cutoff phenomenon; Markov chains; Random graphs; Random walks; Separation distance; Sharp threshold; Stopping time

Indexed keywords

EID: 0035877325     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00201-8     Document Type: Article

References (26)

1. Aigner M. Combinatorial Theory. 1979;Springer, Berlin.
2. Aldous D., Diaconis P. Strong uniform times and finite random walks. Adv. Appl. Math. 8:1987;69-97.
3. D. Aldous, J. Fill, Reversible Markov chains and random walks on graphs, monograph in preparation, 1996.
4. A. Astashkevich, I. Pak, Random walks on nilpotent and supersolvable groups, preprint, 1997.
5. M. Barnabei, A. Brini, G.-C. Rota, The theory of Möbius functions, Usp. Mat. Nauk. 41 (1986) 113-157 (in Russian).
6. Bollobás B. Random Graphs. 1985;Academic Press, London.
7. Diaconis P. Group Representations in Probability and Statistics. 1988;IMS, Hayward, CA.
8. Diaconis P. The cutoff phenomenon in finite Markov chains. Proc. Natl. Acad. Sci. USA. 93:1996;1659-1664.
9. Diaconis P., Fill J.A. Strong stationary times via new form of duality. Ann. Probab. 18:1990;1483-1522.
10. Diaconis P., Graham R., Morrison J. Asymptotic analysis of a random walk on a hypercube with many dimensions. Random Struct. Algorithms. 1:1990;51-72.
11. Dou C., Hildebrand M. Enumeration and random random walks on finite groups. Ann. Probab. 24:1996;987-1000.
12. Erdos, Rényi, On random graphs. I., Publ. Math. Debrecen 6 (1959) 290-297.
13. Feller W. An introduction to Probability Theory and its Applications. 3 Edition:1970;Wiley, New York.
14. Friedgut E., Kalai G. Every monotone graph property has a sharp threshold. Proc. Amer. Math. Soc. 124:1996;2993-3002.
15. Greenhalgh A. A model for random random-walks on finite groups. Combin. Probab. Comput. 6:1997;49-56.
16. L. Lovász, P. Winkler, Mixing Times, AMS DIMACS Series, Vol. 41, AMS Providence, RI, 1998, pp. 189-204.
17. Margulis G. Probabilistic characteristics of graphs with large connectivity. Probl. Peredači Inform. 10:1974;101-108.
18. I. Pak, Random walks on groups: strong uniform time approach, Ph.D. Thesis, Harvard University, 1997.
19. I. Pak, When and how n choose k , DIMACS Workshops on Randomized Algorithms, AMS, Providence, 1998.
20. n , 1998, in preparation.
21. Pak I. Random walks on finite groups with few random generators. Electron J. Probab. 4:1999;1-11.
22. Roichman Y. On random random walks. Ann. Probab. 24:1996;1001-1011.
23. R.P. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth & Brooks / Cole, CA, 1986.
24. Talagrand M. On Russo's approximative zero-one law. Ann. Probab. 22:1994;1576-1587.
25. Whittaker E.T., Watson G.N. A Course of Modern Analysis. 4 Edition:1927;Cambridge University Press, Cambridge, UK.
26. n Probab. Theory Related Fields. 108:1997;441-457.