English

Random walks on Ramanujan complexes and digraphs

Combinatorics 2020-11-05 v2 Probability Representation Theory

Abstract

The cutoff phenomenon was recently confirmed for random walks on Ramanujan graphs by the first author and Peres. In this work, we obtain analogs in higher dimensions, for random walk operators on any Ramanujan complex associated with a simple group GG over a local field FF. We show that if TT is any kk-regular GG-equivariant operator on the Bruhat-Tits building with a simple combinatorial property (collision-free), the associated random walk on the nn-vertex Ramanujan complex has cutoff at time logkn\log_k n. The high dimensional case, unlike that of graphs, requires tools from non-commutative harmonic analysis and the infinite-dimensional representation theory of GG. Via these, we show that operators TT as above on Ramanujan complexes give rise to Ramanujan digraphs with a special property (rr-normal), implying cutoff. Applications include geodesic flow operators, geometric implications, and a confirmation of the Riemann Hypothesis for the associated zeta functions over every group GG, previously known for groups of type A~n\widetilde A_n and C~2\widetilde C_2.

Keywords

Cite

@article{arxiv.1702.05452,
  title  = {Random walks on Ramanujan complexes and digraphs},
  author = {Eyal Lubetzky and Alex Lubotzky and Ori Parzanchevski},
  journal= {arXiv preprint arXiv:1702.05452},
  year   = {2020}
}

Comments

27 pages

R2 v1 2026-06-22T18:21:30.896Z