Emergence of Scaling in Random Networks
- 15 October 1999
- journal article
- other
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 286 (5439), 509-512
- https://doi.org/10.1126/science.286.5439.509
Abstract
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Mean-field theory for scale-free random networksPhysica A: Statistical Mechanics and its Applications, 1999
- Growth dynamics of the World-Wide WebNature, 1999
- Diameter of the World-Wide WebNature, 1999
- Accessibility of information on the webNature, 1999
- Hypersearching the WebScientific American, 1999
- Beyond ReductionismScience, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- Strong Regularities in World Wide Web SurfingScience, 1998
- Searching the World Wide WebScience, 1998
- Social Network AnalysisPublished by Cambridge University Press (CUP) ,1994