Scale-free networks: A decade and beyond

Science

Volumn 325, Issue 5939, 2009, Pages 412-413

  Barabási, Albert László ^a,b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b DANA FARBER CANCER INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; NETWORK ANALYSIS; SCIENCE AND TECHNOLOGY; TECHNOLOGICAL DEVELOPMENT;

ANALYTICAL RESEARCH; CELL INTERACTION; INTERNET; NATURAL SCIENCE; PRIORITY JOURNAL; SCIENCE; SHORT SURVEY; SOCIAL INTERACTION; SOCIAL NETWORK;

MODELS, THEORETICAL; SYSTEMS THEORY;

EID: 67749140118     PISSN: 00368075     EISSN: 10959203     Source Type: Journal    
DOI: 10.1126/science.1173299     Document Type: Short Survey

References (27)

1. P. Erdo″s, A. Rényi, Publ. Math. (Debrecen) 6, 290 (1959).
2. F. Karinthy, in The Structure and Dynamics of Networks, M. Newman, A.-L. Barabasi, D. Watts, Eds. (Princeton Univ. Press, Princeton, NJ, 2006).
3. S. Milgram, Psychol. Today 2, 60 (1967).
4. I. Pool, M. Kochen, Soc. Networks 1, 1 (1978).
5. D. J. Watts, S. H. Strogatz, Nature 393, 440 (1998).
6. A.-L. Barabási, R. Albert, Science 286, 509 (1999).
7. In a random network, the average node sets the scale of the network, which means that most nodes have about the same number of links as the average node. For networks that follow Eq. 1, for γ < 3 the second moment of the distribution diverges, which means that the average is not characteristic because the error bars characterizing our uncertainty about its value are infinite. These networks lack a characteristic scale; hence, they are called scale-free. Formally, networks whose degree distribution follows Eq. 1 are called scale-free networks.
8. R. Albert, H. Jeong, A.-L. Barabási, Nature 401, 130 (1999).
9. S. Redner, Eur. Phys. J. B 4, 131 (1998).
10. G. Caldarelli, Scale-Free Networks (Oxford Univ. Press, Oxford, 2007).
11. S. N. Dorogovtsev, J. F. F. Mendes, Evolution of Networks: From Biological Networks to the Internet and WWW (Oxford Univ. Press, Oxford, 2003).
12. The small-world property refers to the fact that in many networks the average node to node distance is rather small, of the order of log N, where N is the number of nodes in the network.
13. L. A. N. Amaral, A. Scala, M. Barthelemy, H. E. Stanley, Proc. Natl. Acad. Sci. U.S.A. 97, 11149 (2000).
14. E. T. Bullmore, O. Sporns, Nat. Rev. Neurosci. 10, 186 (2009).
15. R. Pastor-Satorras, A. Vespignani, Phys. Rev. Lett. 86, 3200 (2001).
16. R. Cohen, K. Reez, D. Ben-Avraham, S. Havlin, Phys. Rev. Lett. 85, 4626 (2000).
17. R. Albert, H. Jeong, A.-L. Barabási, Nature 406, 378 (2000).
18. A. E. Motter, Phys. Rev. Lett. 93, 098701 (2004).
19. M. E. J. Newman, Phys. Rev. Lett. 89, 208701 (2002).
20. R. Pastor-Satorras, A. Vázquez, A. Vespignani, Phys. Rev. Lett. 87, 258701 (2001).
21. S. Maslov, K. Sneppen, Science 296, 910 (2002).
22. R. Milo et al., Science 298, 824 (2002).
23. M. E. J. Newman, Phys. Today 61, 33 (2008).
24. G. Palla, I. Derényi, I. Farkas, T. Vicsek, Nature 435, 814 (2005).
25. J. Reichardt, S. Bornholdt, Phys. Rev. E 74, 016110 (2006).
26. A. Vespignani, Science 325, 425 (2009).
27. M. C. González, C. A. Hidalgo, A.-L. Barabási, Nature 453, 779 (2008).