Chapter 13. Local search in unstructured networks

  1. Stefan Bornholdt2 and
  2. Hans Georg Schuster3
  1. Lada A. Adamic,
  2. Rajan M. Lukose and
  3. Bernardo A. Huberman

Published Online: 28 JAN 2005

DOI: 10.1002/3527602755.ch13

Handbook of Graphs and Networks: From the Genome to the Internet

Handbook of Graphs and Networks: From the Genome to the Internet

How to Cite

Adamic, L. A., Lukose, R. M. and Huberman, B. A. (2002) Local search in unstructured networks, in Handbook of Graphs and Networks: From the Genome to the Internet (eds S. Bornholdt and H. G. Schuster), Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim, FRG. doi: 10.1002/3527602755.ch13

Editor Information

  1. 2

    University of Leipzig, Germany

  2. 3

    University of Kiel, Germany

Author Information

  1. Hewlett Packard Labs, Palo Alto, CA 94304, USA

Publication History

  1. Published Online: 28 JAN 2005
  2. Published Print: 8 NOV 2002

ISBN Information

Print ISBN: 9783527403363

Online ISBN: 9783527602759

SEARCH

Keywords:

  • unstructured networks;
  • local search;
  • power-law random graphs;
  • simulation;
  • gnutella;
  • path finding;
  • adaptive search

Summary

  • Introduction

  • Search in power-law random graphs

    • Intuition

    • Random walk search

    • Search utilizing high degree nodes

  • Simulation

  • Comparison with Poisson distributed graphs

  • Gnutella

  • Path finding

  • Shortening the shortest path

    • Iterative deepening

  • Adaptive search

  • Conclusion

  • References