Path finding strategies in scale-free networks

Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

Volumn 65, Issue 2, 2002, Pages

  Kim, Beom Jun ^a   Yoon, Chang No ^b   Han, Seung Kee ^b   Jeong, Hawoong ^c  

^a UMEÅ UNIVERSITY   (Sweden)

^b Chungbuk National University   (South Korea)

^c UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL NETWORK INFORMATION; PATH-FINDING ALGORITHMS; SCALE-FREE NETWORKS; SHORTEST PATH (SHT) STRATEGY;

ALGORITHMS; FAILURE ANALYSIS; PROBABILITY; RANDOM PROCESSES; SEARCH ENGINES; TOPOLOGY; WORLD WIDE WEB;

LARGE SCALE SYSTEMS;

EID: 41349088348     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.65.027103     Document Type: Article

References (13)

1. For reviews, see, e.g., a special issue on complex systems in Science Science 284, 79 (1999);
2. M.E.J. Newman, J. Stat. Phys. 101, 819 (2000);D. J. Watts, Small Worlds (Princeton University Press, Princeton, NJ, 1999);
3. S.H. Strogatz, Nature (London) 410, 268 (2001), and references in Refs. 3 and 5.
4. J.M. Kleinberg, Nature (London) 406, 845 (2000).
5. R. Albert, H. Jeong, and A.-L. Barabási, Nature (London) 401, 130 (1999);
6. A.-L. Barabási, R. Albert, and H. Jeong, Physica A 281, 69 (2000).
7. S. Milgram, Psychology Today 2, 60 (1967).
8. A.-L. Barabási and R. Albert, Science 286, 509 (1999);
9. A.-L. Barabási, R. Albert, and H. Jeong, Physica A 272, 173 (1999).
10. This algorithm is called “the burning algorithm” or “the breadth-first search algorithm;” see, e.g., H.J. Herrmann, D.C. Hong, and H.E. Stanley, J. Phys. A 17, L261 (1984);
11. M.E.J. Newman, Phys. Rev. E 64, 016132 (2001), and references therein.
12. R. Albert, H. Jeong, and A.-L. Barabási, Nature (London) 406, 378 (2000).
13. L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman, Phys. Rev. E 64, 046135 (2001).