On the Chung-Diaconis-Graham random process
Let \(Pr(b_n=1)=a\), \(Pr(b_n=0)=b\) and \(Pr(b_n=-1)=c\), \(a+b+c=1\), \(a,b\) and \(c\) are less than 1. Suppose \(b_0,b_1,b_2,\ldots \) are i.i.d. and \(X_0=0\), \(X_{n+1}=2X_n+b_n\) (mod \(p\)) and \(p\) is odd. Let \(P_n(s)=Pr(X_n=s)\). The paper proves: 1. Suppose either \(b=0\) and \(a=c=1/2\) or \(b=1/2\). If \(n>c_1\log _2p\) where \(c_1>1\) is constant, then \(\| P_n-U\| \to 0\) as \(p\to \infty \) where \(p\) is an odd integer. 2. Suppose \(a,b\) and \(c\) do not satisfy the previous conditions. Then there exists a value \(c_2\) (depending on \(a,b\) and \(c\)) such that if \(n<c_2(\log p)\log (\log p)\) and \(p=2^t-1\), then \(\| P_n-U\| \to 1\) as \(t\to \infty \). Here \(\| P-U\| \) is the variation distance, \(U\) the uniform distribution.
- 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
- Mixing time of fractional random walk on finite fields
- Cut-off phenomenon for the ax+b Markov chain over a finite field
- Practical product proofs for lattice commitments
- Accelerating abelian random walks with hyperbolic dynamics
- Markov chains on finite fields with deterministic jumps
- A multiplicatively symmetrized version of the Chung-Diaconis-Graham random process
- On a lower bound for the Chung-Diaconis-Graham random process
- Mixing time of the Chung-Diaconis-Graham random process
- 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
- Random sequences of the form \(X_{t+1}=a_1X_t+b_t\) modulo \(n\) with dependent coefficients \(a_t, b_t\)
- О близости распределения некоторой случайной величины к равновероятному распределению;On the closeness of distribution of some random variable to the equiprobable one
- Modular automata
- Random processes of the form \(X_{n+1}=a_ n X_ n+b_ n\pmod p\)
- Choices, intervals and equidistribution
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)
