A lower bound for the Chung-Diaconis-Graham random process

DOI10.1090/S0002-9939-08-09687-1zbMath1159.60008arXiv0801.3094MaRDI QIDQ3623363

Martin V. Hildebrand

Publication date: 17 April 2009

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.3094

Mathematics Subject Classification ID

Combinatorial probability (60C05) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items (11)

Markov chains on finite fields with deterministic jumps ⋮ Mixing time of the Chung-Diaconis-Graham random process ⋮ Some things we've learned (about Markov chain Monte Carlo) ⋮ On the multiplicative Chung-Diaconis-Graham process ⋮ Speeding up Markov chains with deterministic jumps ⋮ Random walks on rings and modules ⋮ Сходимость матриц переходных вероятностей некоторых цепей Маркова на конечной абелевой группе к равномерной матрице ⋮ Correction to: ``Speeding up Markov chains with deterministic jumps ⋮ On a lower bound for the Chung-Diaconis-Graham random process ⋮ Mixing time of fractional random walk on finite fields ⋮ Accelerating abelian random walks with hyperbolic dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Random processes of the form \(X_{n+1}=a_ n X_ n+b_ n\pmod p\)
• Random walks arising in random number generation
• On the Chung-Diaconis-Graham random process
• Generating uniform random vectors

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