Path finding strategies in scale-free networks.

  title={Path finding strategies in scale-free networks.},
  author={B. Kim and C. Yoon and S. K. Han and H. Jeong},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={65 2 Pt 2},
  • B. Kim, C. Yoon, +1 author H. Jeong
  • Published 2002
  • Physics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • We numerically investigate the scale-free network model of Barabási and Albert [A. L. Barabási and R. Albert, Science 286, 509 (1999)] through the use of various path finding strategies. In real networks, global network information is not accessible to each vertex, and the actual path connecting two vertices can sometimes be much longer than the shortest one. A generalized diameter depending on the actual path finding strategy is introduced, and a simple strategy, which utilizes only local… CONTINUE READING
    171 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    A generic search strategy for large-scale real-world networks
    • 4
    • Highly Influenced
    • PDF
    Searching with Local Information in Complex Networks
    Average path length in random networks.
    • 227
    • PDF
    Finding (Short) Paths in Social Networks
    Greedy routing in small-world networks with power-law degrees
    • 8
    • PDF
    Funnelling Effect in Networks
    • P. Sen
    • Mathematics, Physics
    • Complex
    • 2009
    Local Routing and Traffic Estimating in Large Scale-Free Networks
    • Wei Shi, Z. Zhao
    • Computer Science
    • 2009 First International Workshop on Education Technology and Computer Science
    • 2009
    Navigating Low-Dimensional and Hierarchical Population Networks
    • 21
    • PDF
    Self-avoiding walks on scale-free networks.
    • C. Herrero
    • Medicine, Physics
    • Physical review. E, Statistical, nonlinear, and soft matter physics
    • 2005
    • 55
    • PDF


    • Phys. Rev. E
    Physica A 272, 173 ͑1999͒. ͓6͔ The use of k i ϩ1 instead of k i makes it possible for vertices with
      ͓7͔ This algorithm is called ''the burning algorithm'' or ''the breadth-first search algorithm
      • J. Phys. A
      ͓8͔ We have also tested the MIN strategy, which is opposite to MAX and tries to first connect the vertex with the smallest connectivity