On random random walks

Annals of Probability

Volumn 24, Issue 2, 1996, Pages 1001-1011

  Roichman, Yuval ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Cayley graphs; Diameters; Finite groups; Random walk

Indexed keywords

EID: 0040750069     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/aop/1039639375     Document Type: Article

References (23)

1. ALDOUS, D. and DIACONIS, P. (1986). Shuffling cards and stopping times. Amer. Math. Monthly 93 333-348.
2. ALON, N. (1995). Personal communication.
3. ALON, N., BARAK, A. and MANBER, U. (1987). On disseminating information reliably without broadcasting. In Proc. Seventh Internat. Conf. on Distributed Computing Systems (ICDS) 74-81.
4. 1, isoperimetric inequalities for graphs and superconcentrators. J. Combin. Theory Ser. B 38 73-88.
5. ALON, N. and ROICHMAN, Y. (1994). Random Cayley graphs and expanders. Random Structures Algorithms 5 271-284.
6. BABAI, L. and ERDÖS, P. (1982). Representation of group elements as short products. Ann. Discrete Math. 12 27-30.
7. BABAI, L., HETYEI, G., KANTOR, W. M., LUBOTZKY, A. and SERESS, A. (1990). On the diameter of finite groups. Proc. 31st IEEE FOCS 857-865.
8. BRODER, A. and SHAMIR, E. (1987). On the second eigenvalue of random regular graphs. Proc. 28th IEEE FOCS 286-294.
9. CHUNG, F. R. K. (1989). Diameters and eigenvalues. J. Amer. Math. Soc. 2 187-196.
10. DIACONIS, P. (1988). Group Representations in Probability and Statistics. IMS, Hayward, CA.
11. DIACONIS, P. and SALOFF-COSTE, L. (1993). Comparison techniques for random walk on finite groups. Ann. Probab. 21 2131-2156.
12. DIACONIS, P. and SALOFF-COSTE, L. (1995). Nash inequalities for finite Markov chains. Preprint.
13. DIACONIS, P. and SALOFF-COSTE, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696-730.
14. DOU, C. and HILDEBRAND, M. (1996). Enumeration and random random walks on finite groups. Ann. Probab. 24 987-1000.
15. FRIEDMAN, J. (1991). On the second eigenvalue and random walks in random d-regular graphs. Combinatorica 11 331-362.
16. FRIEDMAN, J., JOUX, A., ROICHMAN, Y., STERN, J. and TILLICH, J. P. (1995). Most regular graphs are quickly r-transitive. Preprint.
17. HILDEBRAND, M. (1994). Random walks supported on random points of ℤ/nℤ. Probab. Theory Related Fields 100 191-203.
18. HORN, R. and JOHNSON, C. (1990). Topics in Matrix Analysis. Cambridge Univ. Press.
19. LUBOTZKY, A. (1994). Discrete Groups, Expanding Graphs and Invariant Measures. Progress in Math. 125. Birkhäuser, Boston.
20. LUBOTZKY, A. (1995). Cayley graphs: eigenvalues, expanders and random walks. Surveys in Combinatorics. To appear.
21. LUBOTZKY, A., PHILLIPS, R. and SARNAK, P. (1988). Ramanujan graphs. Combinatorica 8 261-277.
22. SARNAK, P. (1990). Some Applications of Modular Forms. Cambridge Tracts in Math. 99. Cambridge Univ. Press.
23. 2. Preprint.