Abstract
Small-world networks, exhibiting short nodal distances and high clustering, and scale-free networks, typified by a scale-free, power-law node-degree distribution, have been shown to be widespread both in natural and artificial systems. We propose a new type of network -- cluster-dense network -- characterized by multiple clusters that are highly intra-connected and sparsely inter-connected. Employing two graph-theoretic measures -- local density and relative density -- we demonstrate that such networks are prevalent in the world of networks.
| Original language | English |
|---|---|
| Pages (from-to) | 939-946 |
| Number of pages | 8 |
| Journal | International Journal of Modern Physics C |
| Volume | 19 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1 Jun 2008 |
Keywords
- Graph measures
- Scale-free networks
- Small-world networks
- Social networks
ASJC Scopus subject areas
- Statistical and Nonlinear Physics
- Mathematical Physics
- General Physics and Astronomy
- Computer Science Applications
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'Cluster-dense networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver