Random random walks on the integers mod n

Jack J. Dai and Martin V. Hildebrand

Statistics & Probability Letters, 1997, vol. 35, issue 4, 371-379

Abstract: 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.

Keywords: Random; walks; Upper; bound; lemma; Fourier; transform; Finite; groups (search for similar items in EconPapers)
Date: 1997
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(97)00035-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:35:y:1997:i:4:p:371-379

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().