The measurable Kesten theorem

By Miklós Abért, Yair Glasner, B'alint Vir'ag. 2011

47 citations recorded by the source corpus.

We give explicit estimates between the spectral radius and the densities of short cycles for finite d-regular graphs. This allows us to show that the essential girth of a finite d-regular Ramanujan graph G is at least c log log |G|. We prove that infinite d-regular Ramanujan unimodular random graphs are trees. Using Benjamini-Schramm convergence this leads to a rigidity result saying that if most eigenvalues of a d-regular finite graph G fall in the Alon-Boppana region, then the eigenvalue distribution of G is close to the spectral measure of the d-regular tree. Kesten showed that if a Cayley graph has the same spectral radius as its universal cover, then it must be a tree. We generalize this to unimodular random graphs.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/38a0d08c9afd807eeda7be327f96915bc2b03773

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

  1. Yair Glasner
  2. B'alint Vir'ag
  3. Miklós Abért
  4. Ian Biringer
  5. Nicolas Bergeron
  6. Tsachik Gelander
  7. Iddo Samet
  8. Nikolay Nikolov

In Geometry and Topology

  1. Miklós Abért
  2. Yair Glasner
  3. B'alint Vir'ag
  4. Nikolay Nikolov
  5. Ian Biringer
  6. Iddo Samet
  7. Jean Raimbault
  8. Tsachik Gelander

In Statistics and Probability

  1. Miklós Abért
  2. B'alint Vir'ag
  3. Yair Glasner
  4. Tsachik Gelander
  5. Manjunath Krishnapur
  6. L. Erdős
  7. Nicolas Curien
  8. Horng-Tzer Yau

Citations in the corpus