Random networks: eigenvalue spectra

S.N. Dorogovtsev, A.V. Goltsev, J.F.F. Mendes and A.N. Samukhin

Physica A: Statistical Mechanics and its Applications, 2004, vol. 338, issue 1, 76-83

Abstract: We analyze the spectra of eigenvalues for random graphs with a local tree-like structure. The exact equations to the spectra of networks with a local tree-like structure are presented. We propose a simple approximation, and in the framework of effective medium approximation, calculate spectra of various graphs analytically. We show that spectra of locally tree-like random graphs gives a good description of the spectral properties of real-life networks like the Internet.

Keywords: Complex networks; Spectral analysis; Transfer matrix; Bethe lattice; Random walk; Internet (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437104002225
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:338:y:2004:i:1:p:76-83

DOI: 10.1016/j.physa.2004.02.027

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().