Universality in the spectral and eigenfunction properties of random networks
Abstract
By the use of extensive numerical simulations we show that the nearest-neighbor energy level spacing distribution P(s) and the entropic eigenfunction localization length of the adjacency matrices of Erdos-R\'enyi (ER) fully random networks are universal for fixed average degree α N (α and N being the average network connectivity and the network size, respectively). We also demonstrate that Brody distribution characterizes well P(s) in the transition from α=0, when the vertices in the network are isolated, to α=1, when the network is fully connected. Moreover, we explore the validity of our findings when relaxing the randomness of our network model and show that, in contrast to standard ER networks, ER networks with diagonal disorder also show universality. Finally, we also discuss the spectral and eigenfunction properties of small-world networks.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.