Path finding strategies in scale-free networks
Path finding strategies in scale-free networks
复制标题
DOI：
10.1103/physreve.65.027103
复制
发表时间：
2002-02-01
影响因子：
2.4
通讯作者：
Jeong, H
中科院分区：
文献类型：
--
作者：
Kim, BJ;Yoon, CN;Jeong, H
我们数值研究了Barabasi和Albert [A. L. Barabasi和R. Albert，Science 286，509（1999）]通过使用各种路径寻找策略。在真实的网络中，全局网络信息不能到达每个顶点，连接两个顶点的实际路径有时可能比最短路径长得多。本文引入了一个依赖于实际路径的广义直径，并提出了一个只利用局部连通性信息的简单策略，该策略产生小世界行为：网络的直径D随网络大小N而递增，与全局策略相同。如果随机寻找路径，则找到Dsimilar to N（0.5）。
We numerically investigate the scale-free network model of Barabasi and Albert [A. L. Barabasi 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 information on the connectivity, is suggested and shown to yield small-world behavior: the diameter D of the network increases logarithmically with the network size N, the same as is found with global strategy. If paths are sought at random, Dsimilar toN(0.5) is found.