Spectral properties of complex networks

Simple item page
dc.creatorBianconi, Ginestra
dc.date2008-04-10
dc.date.accessioned2026-07-07T09:31:35Z
dc.date.available2026-07-07T09:31:35Z
dc.descriptionWe derive the spectral properties of adjacency matrix of complex networks and of their Laplacian by the replica method combined with a dynamical population algorithm. By assuming the order parameter to be a product of Gaussian distributions, the present theory provides a solution for the non linear integral equations for the spectra density in random matrix theory of the spectra of sparse random matrices making a step forward with respect to the effective medium approximation (EMA) . We extend these results also to weighted networks with weight-degree correlations
dc.description(11 pages)
dc.identifierhttps://arxiv.org/abs/0804.1744
dc.identifierhttp://arxiv.org/abs/0804.1744
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158512
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleSpectral properties of complex networks
dc.typetext

Files

Collections

arXiv