A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Bounded cutoff window for the non-backtracking random walk on Ramanujan Graphs
[article]
2021
arXiv
pre-print
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
arXiv:2103.15176v2
fatcat:2d4rjvo3cbfsll6u4mzu5ycpc4