On the Chung-Diaconis-Graham random process
Martin Hildebrand
Abstract
Chung, Diaconis, and Graham considered random processes of the form Xn+1=2Xn+bn (mod p) where X0=0, p is odd, and bn for n=0,1,2,... are i.i.d. random variables on -1,0,1. If Pr(bn=-1)= Pr(bn=1)=βand Pr(bn=0)=1-2β, they asked which value of βmakes Xn get close to uniformly distributed on the integers mod p the slowest. In this paper, we extend the results of Chung, Diaconis, and Graham in the case p=2t-1 to show that for 0<β<=1/2, there is no such value of β.
Create a lesson
Related papers
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
Robert Lunde, Soumendra Lahiri
Matching Random Point Sets with Minimum Distortion
Itai Benjamini, Mark Braverman, Elad Tzalik et al.
Uniqueness and full coverage in k-neighbor graphs
David Coupier, Benoît Henry, Benedikt Jahnel et al.
Bass martingales need not stretch
Mathias Beiglböck, Manuel Hasenbichler, Gudmund Pammer
Universality of smallest singular values of random row submatrices and phase retrieval problems
Shu Wen, Christian E. Häggblom, Xiufan Yang