论文信息 - Random random walks on the integers mod n

Random random walks on the integers mod n

This paper considers typical random walks on the integers mod n such that the random walk is supported on constant k values. This paper extends a result of Hildebrand to show that for any integer n, roughly n2/(k-1) steps usually suffice to get the random walk close to uniformly distributed if the k values satisfy some conditions needed for the random walk to get close to uniformly distributed.

Jack Jie Dai | Martin Hildebrand | M. Hildebrand | J. J. Dai

[1] R. Graham,et al. Random Walks Arising in Random Number Generation , 1987 .

[2] Andrew S. Greenhalgh. A Model for Random Random-Walks on Finite Groups , 1997, Comb. Probab. Comput..

[3] Carl C. Z. Dou. Studies of random walks on groups and random graphs , 1992 .

[4] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .

[5] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

[6] P. Diaconis. Group representations in probability and statistics , 1988 .

[7] Martin Hildebrand,et al. Random walks supported on random points ofZ/nZ , 1994 .

[8] Andrew Simon Greenhalgh,et al. Random walks on groups with subgroup invariance properties , 1989 .

[9] Martin Hildebrand,et al. Enumeration and random random walks on finite groups , 1996 .