The-square-and-add Markov chain
From MaRDI portal
Publication:2153973
DOI10.1007/s00283-021-10058-wzbMath1495.60067arXiv2008.11253OpenAlexW3165807685MaRDI QIDQ2153973
I. M. Isaacs, Persi Diaconis, Jimmy He
Publication date: 13 July 2022
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.11253
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks arising in random number generation
- An affine walk on the hypercube
- Binomial coefficient codes over GF(2)
- Speeding up Markov chains with deterministic jumps
- Logarithmic Sobolev inequalities for finite Markov chains
- New algorithms for generating Conway polynomials over finite fields
- Mixing time of the Chung-Diaconis-Graham random process
- The great trinomial hunt
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- Computation of Kazhdan-Lusztig polynomials and some applications to finite groups
- On Artin's conjecture.
- Two New Inequalities
This page was built for publication: The-square-and-add Markov chain
