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
Boolean Small-Ball Inequalities for Discrepancy Theory
Emrullah Akbas, Suvrit Sra
Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior
Arthur Blanc-Renaudie
Point process convergence of large inradii of Poisson-Laguerre tessellations
Matthias Schulte, Martina Švarc Petráková
Interpolation of Gaussian Free Fields via Random Matrices
Gabriel Raposo
Almost-Uniform Bayesian Convergence to the Truth Is Not Characterized by Countable Additivity on Conditional Hitting Times
M. Ali Khan, Arthur Paul Pedersen, Maxwell B. Stinchcombe
The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence
Marc Bernard, Robin Stephenson