Cutoff on Graphs and the Sarnak-Xue Density of Eigenvalues
arXiv:1905.11165 · doi:10.1016/j.ejc.2022.103530
Abstract
It was recently shown by Lubetzky and Peres (2016) and by Sardari (2018) that Ramanujan graphs, i.e., graphs with the optimal spectrum, exhibit cutoff of the simple random walk in an optimal time and have an optimal almost-diameter. We show that this spectral condition can be replaced by a weaker condition, the Sarnak-Xue density property, to deduce similar results. This allows us to prove that some natural families of Schreier graphs of the -action on the projective line exhibit cutoff, thus proving a special case of a conjecture of Rivin and Sardari.
arXiv comment27 pages. v2- many minor corrections
References in corpus (10)
- Kesten's theorem for Invariant Random Subgroups
- Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees
- Super-Golden-Gates for PU(2)
- On the girth of random Cayley graphs
- Ramanujan Coverings of Graphs
- The measurable Kesten theorem
- Cutoff at the entropic time for random walks on covered expander graphs
- Random walks on Ramanujan complexes and digraphs
- Expander Graphs
- Cutoff on Ramanujan complexes and classical groups