ON THE ALMOST EIGENVECTORS OF RANDOM REGULAR GRAPHS By

@inproceedings{Backhausz2018ONTA,
  title={ON THE ALMOST EIGENVECTORS OF RANDOM REGULAR GRAPHS By},
  author={{\'A}gnes Backhausz and Bal{\'a}zs Szegedy},
  year={2018}
}
Let d ≥ 3 be fixed and G be a large random d-regular graph on n vertices. We show that if n is large enough then the entry distribution of every almost eigenvector of G (with entry sum 0 and normalized to have length √ n) is close to some Gaussian distribution N(0, σ) in the weak topology where 0 ≤ σ ≤ 1. Our theorem holds even in the stronger sense when many entries are looked at simultaneously in small random neighborhoods of the graph. Furthermore, we also get the Gaussianity of the joint… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 37 references

A proof of Alon’s second eigenvalue conjecture and related problems

  • J. Friedman
  • Mem. Amer. Math. Soc. 195 viii+100
  • 2008
Highly Influential
7 Excerpts

Quantum Ergodicity on Graphs : from Spectral to Spatial Delocalization

  • N. Anantharaman, M. Sabri
  • 2017
1 Excerpt

Spectral measures of factor of i.i.d. processes on vertex-transitive graphs

  • Á. Backhausz, B. Virág
  • Ann. Inst. Henri Poincaré Probab. Stat
  • 2017
1 Excerpt

Similar Papers

Loading similar papers…