Exploring complex networks by walking on them
Exploring complex networks by walking on them
复制标题
DOI：
10.1103/physreve.71.016107
复制
发表时间：
2005-01-01
影响因子：
2.4
通讯作者：
Yang, SJ
中科院分区：
文献类型：
--
作者：
Yang, SJ
我们对步行者搜索几个典型的复杂网络问题进行了比较研究。对不同策略的搜索效率进行了评估。在不知道底层网络的全局性质和任意两个给定节点之间的最优路径的情况下，发现最好的搜索策略是自避免随机游走。优先自避免随机游走无助于进一步提高搜索效率。反过来，可以通过比较不同搜索策略的结果来提取底层网络的拓扑信息。
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.