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.
%0 Journal Article
%1 Barabasi1999
%A Barabási, Albert László
%A Albert, Réka
%D 1999
%J Science
%K networks scale-free preferential-attachment graphs
%N 5439
%P 509-512
%R 10.1126/science.286.5439.509
%T Emergence of Scaling in Random Networks
%V 286
%X 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.
@article{Barabasi1999,
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.},
added-at = {2011-01-13T13:25:31.000+0100},
author = {Barabási, Albert László and Albert, Réka},
biburl = {https://www.bibsonomy.org/bibtex/2ed4d05eb461160546910485d719d59a9/rincedd},
doi = {10.1126/science.286.5439.509},
file = {Barabasi1999 - Emergence of Scaling in Random Networks.pdf:Barabasi1999 - Emergence of Scaling in Random Networks.pdf:PDF},
groups = {public},
interhash = {89d3f086051d18093558698788063dfe},
intrahash = {ed4d05eb461160546910485d719d59a9},
journal = {Science},
keywords = {networks scale-free preferential-attachment graphs},
number = 5439,
pages = {509-512},
timestamp = {2011-03-30T16:38:21.000+0200},
title = {Emergence of Scaling in Random Networks},
username = {rincedd},
volume = 286,
year = 1999
}