arXiv · 0803.1042
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.
Explore related subjects
Keep this discovery
Taro Nagao, G. J. Rodgers. 2008-03-07. Spectral Density of Complex Networks with a Finite Mean Degree. https://doi.org/10.1088/1751-8113/41/26/265002
Cite the original work for its findings. Save a collection to share your selection of sources.