Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Search in power-law networks.

L A Adamic1, R M Lukose, A R Puniyani

  • 1HP Labs, Palo Alto, California 94304, USA. ladamic@hpl.hp.com

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|November 3, 2001
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Portfolios of quantum algorithms.

Physical review letters·2001
Same author

Evolutionary games and computer simulations.

Proceedings of the National Academy of Sciences of the United States of America·1993
Same author

An associationist model of the paranoid process: application of phase transitions in spreading activation networks.

Psychiatry·1992
Same author

Gaucher's disease: case report of mandibular trauma.

Oral surgery, oral medicine, and oral pathology·1992
Same author

Cooperative solution of constraint satisfaction problems.

Science (New York, N.Y.)·1991
Same author

The stability of ecosystems.

Proceedings of the Royal Society of London. Series B, Biological sciences·1989

This study introduces efficient local search strategies for power-law networks by leveraging high-degree hub nodes. These methods offer sublinear scaling costs, improving search performance in large networks like Gnutella.

Area of Science:

  • Network Science
  • Computer Science
  • Algorithm Design

Background:

  • Many real-world networks, including social and communication systems, exhibit power-law distributions.
  • These networks feature a few high-degree nodes (hubs) and numerous low-degree nodes.
  • Hubs are critical for network connectivity and efficient information flow.

Purpose of the Study:

  • To develop novel local search strategies that exploit the properties of hubs in power-law networks.
  • To design algorithms with search costs that scale sublinearly with network size.
  • To validate the effectiveness of these strategies on a practical peer-to-peer network.

Main Methods:

  • Introduction of local search algorithms tailored for power-law graph structures.
  • Analysis of algorithm costs to demonstrate sublinear scaling.

Related Experiment Videos

  • Empirical evaluation using the Gnutella peer-to-peer network dataset.

    • Main Results:

    • Proposed local search strategies effectively utilize high-degree nodes.
    • Achieved sublinear cost scaling, indicating efficiency for large networks.
    • Demonstrated practical utility and performance on the Gnutella network.

    Conclusions:

    • Leveraging hub nodes in power-law networks enables efficient search algorithms.
    • The developed strategies offer a scalable approach for network searching.
    • These findings have implications for designing efficient search mechanisms in distributed systems.