Mixing time of the lazy and simple random walk on a randomly twisted hypercube

@misc{baran2026mixing,
  title = {{Mixing time of the lazy and simple random walk on a randomly twisted hypercube}},
  author = {Zsuzsanna Baran and Anđela Šarković},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.21976},
  eprint = {2610.21976},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21976},
}

TY  - UNPB
TI  - Mixing time of the lazy and simple random walk on a randomly twisted hypercube
AU  - Zsuzsanna Baran
AU  - Anđela Šarković
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.21976
UR  - https://arxiv.org/abs/2610.21976
AB  - We consider a randomly twisted hypercube on N vertices and study a simple or lazy random walk on this graph. We show that for both walks the mixing time is of order log N, and the model does not exhibit cutoff. We also establish that both walks have cover time of order Nlog N, and we show that the chromatic number of the graph diverges.
ER  -