On the distributions of Laplacian eigenvalues versus node degrees in complex networks

Choujun Zhan, Guanrong Chen and Lam F. Yeung

Physica A: Statistical Mechanics and its Applications, 2010, vol. 389, issue 8, 1779-1788

Abstract: In this paper, the important issue of Laplacian eigenvalue distributions is investigated through theory-guided extensive numerical simulations, for four typical complex network models, namely, the ER random-graph networks, WS and NW small-world networks, and BA scale-free networks. It is found that these four types of complex networks share some common features, particularly similarities between the Laplacian eigenvalue distributions and the node degree distributions.

Keywords: Complex network; Laplacian matrix; Eigenvalue; Graph theory; Node-degree; Random-graph network; Small-world network; Scale-free network (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437109010012
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:389:y:2010:i:8:p:1779-1788

DOI: 10.1016/j.physa.2009.12.005

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 ().