Mixing time of the Chung-Diaconis-Graham random process

DOI10.1007/s00440-020-01009-1zbMath1478.60201arXiv2003.08117OpenAlexW3092385622MaRDI QIDQ2660392

Sean Eberhard, Péter Pál Varjú

Publication date: 30 March 2021

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainsmixing timeChung-Diaconis-Graham random process

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of sieve methods (11N36)

Related Items (10)

Universality of cutoff for graphs with an added random matching ⋮ Markov chains on finite fields with deterministic jumps ⋮ A multiplicatively symmetrized version of the Chung-Diaconis-Graham random process ⋮ The-square-and-add Markov chain ⋮ Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022 ⋮ Cutoff for permuted Markov chains ⋮ On the multiplicative Chung-Diaconis-Graham process ⋮ Correction to: ``Speeding up Markov chains with deterministic jumps ⋮ Mixing time of fractional random walk on finite fields ⋮ Accelerating abelian random walks with hyperbolic dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inverse questions for the large sieve
• Random processes of the form \(X_{n+1}=a_ n X_ n+b_ n\pmod p\)
• An Efron-Stein inequality for nonsymmetric statistics
• Random walks arising in random number generation
• Random walks on discrete groups: Boundary and entropy
• Upper bound of the local law for certain additive functions
• On a lower bound for the Chung-Diaconis-Graham random process
• The entropy of Cantor-like measures
• Concentration Inequalities
• A lower bound for the Chung-Diaconis-Graham random process

This page was built for publication: Mixing time of the Chung-Diaconis-Graham random process