Cutoff for a stratified random walk on the hypercube

From MaRDI portal
Publication:1663741

DOI10.1214/18-ECP132zbMATH Open1397.60096arXiv1705.06153MaRDI QIDQ1663741FDOQ1663741

Anna Ben-Hamou, Yuval Peres

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 (i,j) of distinct coordinates uniformly at random and adding the bit at location i to the bit at location j, modulo 2. We show that this Markov chain has cutoff at time frac32nlogn with window of size n, solving a question posed by Chung and Graham (1997).


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




Recommendations




Cites Work


Cited In (6)





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)