Low-cost search in scale-free networks

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 75, Issue 3, 2007, Pages

  Jeong, Jieun ^a   Berman, Piotr ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; GRAPH THEORY;

HIGH-DEGREE NODES; RANDOM WALK; SEARCH STRATEGY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33847737789     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.75.036104     Document Type: Article

References (8)

1. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.64.046135 64, 046135 (2001).
2. J. Kleinberg, The Small World Phenomenon: An Algorithmic Perspective, in Proceedings of the 32nd SToC (2000), pp. 163-170.
3. D. Watts and S. Strogatz, Nature (London) NATUAS 0028-0836 10.1038/30918 393, 440 (1998).
4. A-L. Barabasi and R. Albert, Science SCIEAS 0036-8075 10.1126/science.286.5439.509 286, 509 (1999).
5. W. Aiello, F. Chung, and L. Lu, in A Random Graph Model for Massive Graphs, Proceedings of the 32nd SToC (2000), pp. 171-180.
6. Clip2 Company, GNUTELLA, http://www.clip2.com/gnutella
7. H. P. Thadakamalla, R. Albert, and S. R. T. Kumara, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.72.066128 72, 066128 (2005).
8. L. C. Freeman, Soc. Networks ZZZZZZ 0378-8733 1, 215 (1979).