Bounded cutoff window for the non-backtracking random walk on Ramanujan Graphs
Probability
2021-05-07 v2 Combinatorics
Group Theory
Number Theory
Abstract
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
Cite
@article{arxiv.2103.15176,
title = {Bounded cutoff window for the non-backtracking random walk on Ramanujan Graphs},
author = {Evita Nestoridi and Peter Sarnak},
journal= {arXiv preprint arXiv:2103.15176},
year = {2021}
}
Comments
16 pages, the second version fixes some minor typos