Return to Colloquia & Seminar listing
Bounded window cutoff for random walks on Ramanujan graphs
ProbabilitySpeaker: | Evita Nestoridi, Princeton University |
Location: | zoom |
Start time: | Wed, May 19 2021, 4:10PM |
In 2016, Lubetzky and Peres proved that on every Ramanujan graph with vertices and degree , the simple random walk exhibits cutoff at . In this talk, we will focus on the non-backtracking random walk on and prove that it exhibits cutoff at with a bounded window, provided that the girth of is big. This is joint work with Peter Sarnak.