Type: Article
Publication Date: 2023-04-01
Citations: 0
DOI: https://doi.org/10.1007/s00493-023-00017-8
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
Action | Title | Year | Authors |
---|