Random networks: Eigenvalue spectra

17Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

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. © 2004 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Dorogovtsev, S. N., Goltsev, A. V., Mendes, J. F. F., & Samukhin, A. N. (2004). Random networks: Eigenvalue spectra. In Physica A: Statistical Mechanics and its Applications (Vol. 338, pp. 76–83). https://doi.org/10.1016/j.physa.2004.02.027

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free