Localization of eigenvectors in random graphs

Abstract

Using exact numerical diagonalization, we investigate localization in two classes of random matrices corresponding to random graphs. The first class comprises the adjacency matrices of Erdos-Renyi (ER) random graphs. The second one corresponds to random cubic graphs, with Gaussian random variables on the diagonal. We establish the position of the mobility edge, applying the finite-size analysis of the inverse participation ratio. The fraction of localized states is rather small on the ER graphs and decreases when the average degree increases. On the contrary, on cubic graphs the fraction of localized states is large and tends to $1$ when the strength of the disorder increases, implying that for sufficiently strong disorder all states are localized. The distribution of the inverse participation ratio in localized phase has finite width when the system size tends to infinity and exhibits complicated multi-peak structure. We also confirm that the statistics of level spacings is Poissonian in the localized regime, while for extended states it corresponds to the Gaussian orthogonal ensemble.

References in corpus (9)

• Anderson Transitions
• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• Spectra of Sparse Random Matrices
• On the localization transition in symmetric random matrices
• Extended States in a Lifshitz Tail Regime for Random Schrödinger Operators on Trees
• Delocalization transition for the Google matrix
• Localization properties of a tight-binding electronic model on the Apollonian network
• Equivalence of replica and cavity methods for computing spectra of sparse random matrices
• Eigenvector localization as a tool to study small communities in online social networks

Cited by in corpus (23)

• Anderson localization on random regular graphs
• Fractality of wave functions on a Cayley tree: Difference between a tree and a locally tree-like graph without boundary
• Cavity and replica methods for the spectral density of sparse symmetric random matrices
• Universality in the spectral and eigenfunction properties of random networks
• Large deviation function for the number of eigenvalues of sparse random graphs inside an interval
• Localization and universality of eigenvectors in directed random graphs
• Delocalization at small energy for heavy-tailed random matrices
• Dynamical systems on large networks with predator-prey interactions are stable and exhibit oscillations
• Analytic solution of the resolvent equations for heterogeneous random graphs: spectral and localization properties
• Stress Response of Granular Systems
• Scattering and transport properties of tight-binding random networks
• Normal mode analysis of spectra of random networks
• Index statistical properties of sparse random graphs
• Multifractality in random networks with power-law decaying bond strengths
• Localization in random bipartite graphs: numerical and empirical study
• Moments of the inverse participation ratio for the Laplacian on finite regular graphs
• Theory for the conditioned spectral density of non-invariant random matrices
• Finite size effects. The averaged eigenvalue density of Wigner random sign real symmetric matrices
• Eigenvalue spectral tails and localization properties of asymmetric networks
• Phase transitions in atypical systems induced by a condensation transition on graphs
• A path integral approach to sparse non-Hermitian random matrices
• Random cubic graph embedded in a hypercube: Entanglement spectrum and many-body localization
• Statistical mechanics of vector Hopfield network near and above saturation