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 Erdős-Rényi (ER) {\it fully} random networks are universal for fixed average degree $\xi \equiv \alpha N$ ($\alpha$ 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 $\alpha =0$, when the vertices in the network are isolated, to $\alpha =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 {\it diagonal disorder} also show universality. Finally, we also discuss the spectral and eigenfunction properties of small-world networks.

11 pages, 9 figures

References in corpus (16)

• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• Spectra of Sparse Random Matrices
• Quantum transport on small-world networks: A continuous-time quantum walk approach
• Experimental and numerical investigation of the reflection coefficient and the distributions of Wigner's reaction matrix for irregular graphs with absorption
• Random matrix analysis of complex networks
• Cavity approach to the spectral density of non-Hermitian sparse matrices
• Spectral properties of the Google matrix of the World Wide Web and other directed networks
• Delocalization transition for the Google matrix
• Random matrix analysis of network Laplacians
• Localization properties of a tight-binding electronic model on the Apollonian network
• First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation
• Spectral transitions in networks
• Von Neumann entropy and localization-delocalization transition of electron states in quantum small-world networks
• Nearest-neigbor spacing distributions of the beta-Hermite ensemble of random matrices
• Equivalence of replica and cavity methods for computing spectra of sparse random matrices
• Spectral Density of Complex Networks with a Finite Mean Degree

Cited by in corpus (1)

• Weighted random--geometric and random--rectangular graphs: Spectral and eigenfunction properties of the adjacency matrix