Random walks on complex networks
Random walks on complex networks
复制标题
DOI：
10.1103/physrevlett.92.118701
复制
发表时间：
2004-03-19
影响因子：
8.6
通讯作者：
Rieger, H
中科院分区：
文献类型：
--
作者：
Noh, JD;Rieger, H
我们研究复杂网络上的随机游走，并得出两个节点之间的平均首次通过时间 (MFPT) 的精确表达式。我们为每个节点引入随机游走中心性 C，它是其协调数与特征弛豫时间之间的比率，并表明它本质上决定了 MFPT。节点的中心性决定了节点在随机过程中在网络上接收和传播信息的相对速度。对在范式网络模型上移动的随机游走者集合的数值模拟证实了这一分析预测。
We investigate random walks on complex networks and derive an exact expression for the mean first-passage time (MFPT) between two nodes. We introduce for each node the random walk centrality C, which is the ratio between its coordination number and a characteristic relaxation time, and show that it determines essentially the MFPT. The centrality of a node determines the relative speed by which a node can receive and spread information over the network in a random process. Numerical simulations of an ensemble of random walkers moving on paradigmatic network models confirm this analytical prediction.