Cutoff on Ramanujan complexes and classical groups

arXiv: Probability(2022)

Cited 5|Views12
No score
Abstract
The total-variation cutoff phenomenon has been conjectured to hold for simple random walk on all transitive expanders. However, very little is actually known regarding this conjecture, and cutoff on sparse graphs in general. In this paper we establish total-variation cutoff for simple random walk on Ramanujan complexes of type (A) over tilde (d) (d >= 1). As a result, we obtain explicit generators for the finite classical groups PGL(n) (F-q) for which the associated Cayley graphs exhibit total-variation cutoff.
More
Translated text
Key words
Cutoff, random walks, expanders, Bruhat-Tits buildings, Ramanujan complexes
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined