Cutoff on Ramanujan complexes and classical groups
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 Ad (d≥1). As a result, we obtain explicit generators for the finite classical groups PGLn(Fq) for which the associated Cayley graphs exhibit total-variation cutoff.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.