The integrated density of states of the random graph Laplacian

Abstract

We analyse the density of states of the random graph Laplacian in the percolating regime. A symmetry argument and knowledge of the density of states in the nonpercolating regime allows us to isolate the density of states of the percolating cluster (DSPC) alone, thereby eliminating trivially localised states due to finite subgraphs. We derive a nonlinear integral equation for the integrated DSPC and solve it with a population dynamics algorithm. We discuss the possible existence of a mobility edge and give strong evidence for the existence of discrete eigenvalues in the whole range of the spectrum.

4 pages, 1 figure. Supplementary material available at http://www.theorie.physik.uni-goettingen.de/~aspel/data/spectrum_supplement.pdf

References in corpus (1)

• The Alexander-Orbach conjecture holds in high dimensions

Cited by in corpus (6)

• A simple random matrix model for the vibrational spectrum of jammed packings
• Emergent percolation length and localization in random elastic networks
• A unifying model for random matrix theory in arbitrary space dimensions
• Hammerstein equations for sparse random matrices
• Sparse Random Block Matrices
• First return times on sparse random graphs