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 n(2/(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. (C) 1997 Elsevier Science B.V.