Back to Search Start Over

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

Authors :
Nestoridi, Evita
Sarnak, Peter
Publication Year :
2021

Abstract

We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.<br />Comment: 16 pages, the second version fixes some minor typos

Subjects

Subjects :
Mathematics - Probability
Mathematics - Combinatorics
Mathematics - Group Theory
Mathematics - Number Theory

Details

Database :
arXiv
Publication Type :
Report
Accession number :
edsarx.2103.15176
Document Type :
Working Paper

Tools

Authors Abstract Subjects Details