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.
%0 Journal Article
%1 Noh2004
%A Noh, Jae D.
%A Rieger, Heiko
%D 2004
%I American Physical Society
%J Phys. Rev. Lett.
%K diffusion graphs networks random-walks
%N 11
%P 118701
%R 10.1103/PhysRevLett.92.118701
%T Random Walks on Complex Networks
%V 92
%X 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.
@article{Noh2004,
abstract = {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.},
added-at = {2011-06-14T14:31:49.000+0200},
author = {Noh, Jae D. and Rieger, Heiko},
biburl = {https://www.bibsonomy.org/bibtex/2118aa0b4ca46970486dcf4e38f72ba25/rincedd},
doi = {10.1103/PhysRevLett.92.118701},
file = {Noh2004 - Random Walks on Complex Networks.pdf:Noh2004 - Random Walks on Complex Networks.pdf:PDF},
groups = {public},
interhash = {6dba6b1366d773f2846e1947373bb93e},
intrahash = {1877dacb55d69d297e71fabd3f2900ff},
journal = {Phys. Rev. Lett.},
keywords = {diffusion graphs networks random-walks},
number = 11,
pages = 118701,
publisher = {American Physical Society},
timestamp = {2011-06-14T14:33:01.000+0200},
title = {Random Walks on Complex Networks},
username = {rincedd},
volume = 92,
year = 2004
}