Localization of eigenvectors in random graphs

From MaRDI portal
Publication:6135101

DOI10.1140/EPJB/E2012-30338-1zbMATH Open1515.05162arXiv1401.1681MaRDI QIDQ6135101FDOQ6135101


Authors: Frantisek Slanina Edit this on Wikidata


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 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.


Full work available at URL: https://arxiv.org/abs/1401.1681




Recommendations




Cites Work


Cited In (10)





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)