Emergence of Scaling in Random Networks

American Association for the Advancement of Science (AAAS) - Tập 286 Số 5439 - Trang 509-512 - 1999
Albert‐László Barabási1, Réka Albert1
1Department of Physics, University of Notre Dame, Notre Dame, IN 46556, USA

Tóm tắt

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.

Từ khóa


Tài liệu tham khảo

10.1126/science.284.5411.79

; R. F. Service ibid. p. 80.

G. Weng U. S. Bhalla R. Iyengar ibid. p. 92.

C. Koch and G. Laurent ibid. p. 96.

S. Wasserman and K. Faust Social Network Analysis (Cambridge Univ. Press Cambridge 1994).

Members of the Clever project Sci. Am. 280 54 (June 1999).

Albert R., Jeong H., Barabási A.-L., Nature 401, 130 (1999);

Barabási A.-L., Albert R., Jeong H., Physica A 272, 173 (1999);

; see also .

P. Erdős and

Rényi A., Publ. Math. Inst. Hung. Acad. Sci. 5, 17 (1960);

; B. Bollobás Random Graphs (Academic Press London 1985).

10.1126/science.280.5360.98

; Nature 400 107 (1999).

In addition to the distribution of incoming links the WWW displays a number of other scale-free features characterizing the organization of the Web pages within a domain [

10.1038/43604

] the distribution of searches [

10.1126/science.280.5360.95

] or the number of links per Web page (6).

10.1038/30918

Redner S., Eur. Phys. J. B 4, 131 (1998).

We also studied the neural network of the worm Caenorhabditis elegans (3 10) and the benchmark diagram of a computer chip (see ). We found that P(k) for both was consistent with power-law tails despite the fact that for C. elegans the relatively small size of the system (306 vertices) severely limits the data quality whereas for the wiring diagram of the chips vertices with over 200 edges have been eliminated from the database.

Milgram S., Psychol. Today 2, 60 (1967);

; M. Kochen ed. The Small World (Ablex Norwood NJ 1989).

J. Guare Six Degrees of Separation: A Play (Vintage Books New York 1990).

Barthélémy M., Amaral L. A. N., Phys. Rev. Lett. 82, 15 (1999).

For most networks the connectivity m of the newly added vertices is not constant. However choosing m randomly will not change the exponent γ (Y. Tu personal communication).

10.1126/science.284.5411.107

Preferential attachment was also used to model evolving networks (L. A. N. Amaral and M. Barthélémy personal communication).

Banavar J. R., Maritan A., Rinaldo A., Nature 399, 130 (1999).

We thank D. J. Watts for providing the C. elegans and power grid data B. C. Tjaden for supplying the actor data H. Jeong for collecting the data on the WWW and L. A. N. Amaral for helpful discussions. This work was partially supported by NSF Career Award DMR-9710998.