Scale-free networks with an exponent less than two
- 10 April 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 73 (4) , 046113
Abstract
We study scale-free simple graphs with an exponent of the degree distribution less than 2. Generically one expects such extremely skewed networks—which occur very frequently in systems of virtually or logically connected units—to have different properties than those of scale free networks with : The number of links grows faster than the number of nodes and they naturally posses the small world property, because the diameter increases by the logarithm of the size of the network and the clustering coefficient is finite. We discuss a simple prototype model of such networks, inspired by real world phenomena, which exhibits these properties and allows for a detailed analytical investigation.
Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Jamming is limited in scale-free systemsNature, 2004
- Evolution of Networks2003
- Scale-free topology of e-mail networksPhysical Review E, 2002
- Topology of technology graphs: Small world patterns in electronic circuitsPhysical Review E, 2001
- Scientific collaboration networks. I. Network construction and fundamental resultsPhysical Review E, 2001
- Lethality and centrality in protein networksNature, 2001
- Graph structure in the WebComputer Networks, 2000
- Emergence of Scaling in Random NetworksScience, 1999
- How popular is your paper? An empirical study of the citation distributionThe European Physical Journal B, 1998
- Collective dynamics of ‘small-world’ networksNature, 1998