期刊
EUROPEAN PHYSICAL JOURNAL B
卷 84, 期 4, 页码 691-697出版社
SPRINGER
DOI: 10.1140/epjb/e2011-20834-1
关键词
-
资金
- National Natural Science Foundation of China [61074119]
- Hong Kong Research Grants Council under the GRF [CityU 1114/11E]
In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of an associated matrix similar to the transition matrix. We then apply the formula to derive a lower bound for the MFPT to arrive at a given node with the starting point chosen from the stationary distribution over the set of nodes. We show that for a correlated scale-free network of size N with a degree distribution P(d) similar to d (-gamma) , the scaling of the lower bound is N (1-1/gamma) . Also, we provide a simple derivation for an eigentime identity. Our work leads to a comprehensive understanding of recent results about random walks on complex networks, especially on scale-free networks.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据