Search in power-law networks
Top Cited Papers
- 26 September 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 64 (4) , 046135
- https://doi.org/10.1103/physreve.64.046135
Abstract
Many communication and social networks have power-law link distributions, containing a few nodes that have a very high degree and many with low degree. The high connectivity nodes play the important role of hubs in communication and networking, a fact that can be exploited when designing efficient search algorithms. We introduce a number of local search strategies that utilize high degree nodes in power-law graphs and that have costs scaling sublinearly with the size of the graph. We also demonstrate the utility of these strategies on the GNUTELLA peer-to-peer network.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- The large-scale organization of metabolic networksNature, 2000
- Navigation in a small worldNature, 2000
- Error and attack tolerance of complex networksNature, 2000
- Emergence of Scaling in Random NetworksScience, 1999
- Growth dynamics of the World-Wide WebNature, 1999