Exploring complex networks by walking on them

Shi-Jie Yang
Phys. Rev. E 71, 016107 – Published 5 January 2005

Abstract

We carry out a comparative study of the problem of a walker searching several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks and the optimal path between any two given nodes, it is found that the best search strategy is the self-avoiding random walk. The preferentially self-avoiding random walk does not help in improving the search efficiency further. In return, topological information of the underlying networks may be drawn by comparing the results of the different search strategies.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 10 June 2004

DOI:https://doi.org/10.1103/PhysRevE.71.016107

©2005 American Physical Society

Authors & Affiliations

Shi-Jie Yang

  • Department of Physics, Beijing Normal University, Beijing 100875, China

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 71, Iss. 1 — January 2005

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×