## Electronic Communications in Probability

### Cutoff for a stratified random walk on the hypercube

#### 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 $\frac{3} {2}n\log n$ with window of size $n$, solving a question posed by Chung and Graham (1997).

#### Article information

Source
Electron. Commun. Probab., Volume 23 (2018), paper no. 32, 10 pp.

Dates
Accepted: 10 April 2018
First available in Project Euclid: 26 May 2018

https://projecteuclid.org/euclid.ecp/1527300061

Digital Object Identifier
doi:10.1214/18-ECP132

Mathematical Reviews number (MathSciNet)
MR3812064

Zentralblatt MATH identifier
1397.60096

#### Citation

Ben-Hamou, Anna; Peres, Yuval. Cutoff for a stratified random walk on the hypercube. Electron. Commun. Probab. 23 (2018), paper no. 32, 10 pp. doi:10.1214/18-ECP132. https://projecteuclid.org/euclid.ecp/1527300061

#### References

• [1] D. Andrén, L. Hellström, and K. Markström. On the complexity of matrix reduction over finite fields. Advances in applied mathematics, 39(4):428–452, 2007.
• [2] D. Christofides. The asymptotic complexity of matrix reduction over finite fields. arXiv preprint arXiv:1406.5826, 2014.
• [3] F. R. K. Chung and R. L. Graham. Stratified random walks on the n-cube. Random Structures and Algorithms, 11(3):199–222, 1997.
• [4] P. Diaconis and L. Saloff-Coste. Walks on generating sets of abelian groups. Probability theory and related fields, 105(3):393–421, 1996.
• [5] M. Kassabov. Kazhdan constants for $\mbox{SL} _n(\mathbb{Z} )$. International Journal of Algebra and Computation, 15(05n06):971–995, 2005.
• [6] D. Levin, Y. Peres, and E. Wilmer. Markov chains and mixing times. AMS Bookstore, 2009.
• [7] A. Sotiraki. Authentication protocol using trapdoored matrices. PhD thesis, Massachusetts Institute of Technology, 2016.