Cutoff for a stratified random walk on the hypercube
From MaRDI portal
Publication:1663741
DOI10.1214/18-ECP132zbMATH Open1397.60096arXiv1705.06153MaRDI QIDQ1663741FDOQ1663741
Publication date: 23 August 2018
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Abstract: We consider the random walk on the hypercube which moves by picking an ordered pair of distinct coordinates uniformly at random and adding the bit at location to the bit at location , modulo . We show that this Markov chain has cutoff at time with window of size , solving a question posed by Chung and Graham (1997).
Full work available at URL: https://arxiv.org/abs/1705.06153
Recommendations
- Cutoff for a stratified random walk on the hypercube
- Stratified random walks on then-cube
- Cutpoints of non-homogeneous random walks
- A class of random walks on the hypercube
- Cutoff for random walk on dynamical Erdős-Rényi graph
- Cutoff phenomena for random walks on random regular graphs
- Cutoff phenomenon for random walks on Kneser graphs
- Cutoff phenomenon for nearest Lamperti's random walk
- A discrete random walk on the hypercube
Cites Work
Cited In (6)
- Fast mixing of a randomized shift-register Markov chain
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Cutoff for product replacement on finite groups
- An affine walk on the hypercube
- Cutoff for the Fredrickson-Andersen one spin facilitated model
- On mixing times for stratified walks on thed-cube
This page was built for publication: Cutoff for a stratified random walk on the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663741)