On the Chung-Diaconis-Graham random process
From MaRDI portal
Abstract: Chung, Diaconis, and Graham considered random processes of the form X_{n+1}=2X_n+b_n (mod p) where X_0=0, p is odd, and b_n for n=0,1,2,... are i.i.d. random variables on {-1,0,1}. If Pr(b_n=-1)= Pr(b_n=1)=�eta and Pr(b_n=0)=1-2�eta, they asked which value of �eta makes X_n 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=2^t-1 to show that for 0<�eta<=1/2, there is no such value of �eta.
Recommendations
- On a lower bound for the Chung-Diaconis-Graham random process
- A lower bound for the Chung-Diaconis-Graham random process
- A multiplicatively symmetrized version of the Chung-Diaconis-Graham random process
- Mixing time of the Chung-Diaconis-Graham random process
- scientific article; zbMATH DE number 16828
- On the Chung law for compound renewal processes
- A stochastic variant of Chow-Rashewski theorem on the Grushin distribution
- On the weighted Grünwald-Rogosinski process
- On the distribution of verhulst process
- scientific article; zbMATH DE number 6119938
Cited in
(15)- Accelerating abelian random walks with hyperbolic dynamics
- A multiplicatively symmetrized version of the Chung-Diaconis-Graham random process
- Random processes of the form \(X_{n+1}=a_ n X_ n+b_ n\pmod p\)
- Modular automata
- Practical product proofs for lattice commitments
- Random sequences of the form \(X_{t+1}=a_1X_t+b_t\) modulo \(n\) with dependent coefficients \(a_t, b_t\)
- Convergence in total variation of an affine random recursion in \({[0, p)}^k\) to a uniform random vector
- A lower bound for the Chung-Diaconis-Graham random process
- Choices, intervals and equidistribution
- Mixing time of the Chung-Diaconis-Graham random process
- Mixing time of fractional random walk on finite fields
- Cut-off phenomenon for the ax+b Markov chain over a finite field
- Markov chains on finite fields with deterministic jumps
- О близости распределения некоторой случайной величины к равновероятному распределению;On the closeness of distribution of some random variable to the equiprobable one
- On a lower bound for the Chung-Diaconis-Graham random process
This page was built for publication: On the Chung-Diaconis-Graham random process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461005)
