Bounded cutoff window for the non-backtracking random walk on Ramanujan Graphs
arXiv:2103.15176
Abstract
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
16 pages, the second version fixes some minor typos