108 citations · 552 across the 31 of their papers we have counts for
1 paper · 2 filters
Evita Nestoridi, Peter Sarnak
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.