activity
20172025
most citedOn the spectrum of random walks on complete finite -ary trees

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

math.PR2021

Bounded cutoff window for the non-backtracking random walk on Ramanujan Graphs

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.