Localization of eigenvectors in random graphs
From MaRDI portal
Publication:6135101
DOI10.1140/EPJB/E2012-30338-1zbMATH Open1515.05162arXiv1401.1681MaRDI QIDQ6135101FDOQ6135101
Authors: Frantisek Slanina
Publication date: 26 July 2023
Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)
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 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.
Full work available at URL: https://arxiv.org/abs/1401.1681
Recommendations
- Delocalization transition for critical Erdős-Rényi graphs
- The completely delocalized region of the Erdős-Rényi graph
- Sparse regular random graphs: spectral density and eigenvectors
- LOCALIZATION ON A QUANTUM GRAPH WITH A RANDOM POTENTIAL ON THE EDGES
- Localization on quantum graphs with random vertex couplings
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Caught by disorder. Bound states in random media
- Title not available (Why is that?)
- A numerical study of sparse random matrices
- Density of states of sparse random matrices
- Spectra of sparse random matrices
- Random incidence matrices: moments of the spectral density
- Sparse random matrices: the eigenvalue spectrum revisited
- Resolvent of large random graphs
- Eigenvalue distribution of large dilute random matrices
- Anderson localization on the Cayley tree: multifractal statistics of the transmission at criticality and off criticality
- Anderson model on Bethe lattices: density of states, localization properties and isolated eigenvalue
- Spectra of modular and small-world matrices
Cited In (10)
- Localized phase for the Erdős-Rényi graph
- Moments of the inverse participation ratio for the Laplacian on finite regular graphs
- Universality in Anderson localization on random graphs with varying connectivity
- An algorithm for identifying eigenvectors exhibiting strong spatial localization
- Eigenvector delocalization for non‐Hermitian random matrices and applications
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
- Localized eigenvectors on metric graphs
- Stress response of granular systems
- Delocalization at small energy for heavy-tailed random matrices
- Path counting on simple graphs: from escape to localization
This page was built for publication: Localization of eigenvectors in random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135101)