On a lower bound for the Chung-Diaconis-Graham random process

DOI10.1016/j.spl.2019.04.020zbMath1459.60016OpenAlexW2944332497MaRDI QIDQ2322655

Martin V. Hildebrand

Publication date: 5 September 2019

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2019.04.020

zbMATH Keywords

lower boundChung-Diaconis-Graham random process

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items (5)

Markov chains on finite fields with deterministic jumps ⋮ 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 ⋮ Accelerating abelian random walks with hyperbolic dynamics

Cites Work

• Unnamed Item
• A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
• Random walks arising in random number generation
• On the Chung-Diaconis-Graham random process
• A lower bound for the Chung-Diaconis-Graham random process

This page was built for publication: On a lower bound for the Chung-Diaconis-Graham random process