Random random walks on ℤd2

Probability Theory and Related Fields

Volumn 108, Issue 4, 1997, Pages 441-457

  Wilson, David Bruce ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Hypercube; Mixing time; Randon walk; Threshold

Indexed keywords

EID: 0040684018     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004400050116     Document Type: Article

References (19)

1. Aldous, D., Diaconis, P.: Shuffling cards and stopping times. Technical Report 231, Department of Statistics, Stanford University (1985)
2. Alon, N., Roichman, Y.: Random Cayley graphs and expanders. Random Structures and Algorithms, 5(2), 271-284 (1994)
3. Diaconis, P.: Group Representations in Probability and Statistics. Institute of Mathematical Statistics (1988)
4. Diaconis, P.: Personal communication (1993)
5. Diaconis, P., Graham, R.L., Morrison, J.A.: Asymptotic analysis of a random walk on a hypercube with many dimensions. Random Structures and Algorithms, 1(1), 51-72 (1990)
6. Diaconis, P., Shahshahani, M.: Time to reach stationarity in the Bernoulli-Laplace diffusion model. SIAM Journal on Mathematical Analysis, 18(1), 208-218 (1987)
7. Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. The Annals of Applied Probability, 1(1), 36-61 (1991)
8. Dou, C., Hildebrand, M.: Enumeration and random random walks on finite groups. The Annals of Probability, 24(2), 987-1000 (1996)
9. Dou, C.C.Z.: Studies of Random Walks on Groups and Random Graphs. PhD thesis, Department of Mathematics, MIT (1992)
10. Greenhalgh, A.S.: A model for random random-walks on finite groups. Submitted (1993)
11. Hildebrand, M.: Personal communication (1963)
12. Massey, M.: Threshold Decoding. M.I.T. Press (1963)
13. McDiarmid, C.: On the method of bounded differences. In Surveys in Combinatorics, 1989 pages 148-188 (1989)
14. Peterson, W.W., Weldon, Jr., E.J.: Error-Correcting Codes. The MIT Press, second edition (1972)
15. Roichman, Y.: On random random walks. The Annals of Applied Probability, 24(2), 1001-1011 (1996)
16. Ross, K.A., Xu, D.: A comparison theorem on convergence rates of random walks on groups. Journal of Theoretical Probability, 6(2), 323-343 (1993)
17. Shoup, V.: New algorithms for finding irreducible polynomials over finite fields. Mathematics of Computation, 54(189), 435-447 (1990)
18. Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser (1993)
19. Wilson, D.B.: Random random walks on Abelian groups. Manuscript (1994)