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. © 2009 Elsevier B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 1779-1788 |
| Journal | Physica A: Statistical Mechanics and its Applications |
| Volume | 389 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 15 Apr 2010 |
Research Keywords
- Complex network
- Eigenvalue
- Graph theory
- Laplacian matrix
- Node-degree
- Random-graph network
- Scale-free network
- Small-world network
Fingerprint
Dive into the research topics of 'On the distributions of Laplacian eigenvalues versus node degrees in complex networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver