Random Walks on Complex Networks
统计力学
2007-05-23 v2
摘要
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 , 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.
引用
@article{arxiv.cond-mat/0307719,
title = {Random Walks on Complex Networks},
author = {Jae Dong Noh and Heiko Rieger},
journal= {arXiv preprint arXiv:cond-mat/0307719},
year = {2007}
}
备注
published version (4 pages, 2 eps figures)