title: Exploring complex networks by walking on them.
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.
authors.affiliation: Department of Physics, Beijing Normal University, Beijing 100875, China.
authors.forename: Shi-Jie
authors.initials: SJ
authors.lastname: Yang