Spectral Density of Complex Networks with a Finite Mean Degree

Abstract

In order to clarify the statistical features of complex networks, the spectral density of adjacency matrices has often been investigated. Adopting a static model introduced by Goh, Kahng and Kim, we analyse the spectral density of complex scale free networks. For that purpose, we utilize the replica method and effective medium approximation (EMA) in statistical mechanics. As a result, we identify a new integral equation which determines the asymptotic spectral density of scale free networks with a finite mean degree $p$. In the limit $p\to \infty$, known asymptotic formulae are rederived. Moreover, the $1/p$ corrections to known results are analytically calculated by a perturbative method.

18 pages, 1 figure, minor corrections made

Cited by in corpus (8)

• Universality in the spectral and eigenfunction properties of random networks
• First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation
• Equivalence of replica and cavity methods for computing spectra of sparse random matrices
• Eigenvalue spectra and stability of directed complex networks
• Localization in random bipartite graphs: numerical and empirical study
• Eigenvector localization as a tool to study small communities in online social networks
• Persistent individual bias in a voter model with quenched disorder
• Random Matrix Analysis of Multiplex Networks