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.
Description
[cond-mat/0307719] Random Walks on Complex Networks
%0 Journal Article
%1 noh-2004-92
%A Noh, Jae Dong
%A Rieger, Heiko
%D 2004
%J Physical Review Letters
%K complex first imported network passage random rieger walk
%P 118701
%T Random Walks on Complex Networks
%U doi:10.1103/PhysRevLett.92.118701
%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{noh-2004-92,
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 = {2007-12-22T15:20:12.000+0100},
author = {Noh, Jae Dong and Rieger, Heiko},
biburl = {https://www.bibsonomy.org/bibtex/20cf188bd11cbb7b98ee7df12afb63a78/andreab},
description = {[cond-mat/0307719] Random Walks on Complex Networks},
interhash = {6dba6b1366d773f2846e1947373bb93e},
intrahash = {0cf188bd11cbb7b98ee7df12afb63a78},
journal = {Physical Review Letters},
keywords = {complex first imported network passage random rieger walk},
pages = 118701,
timestamp = {2007-12-22T15:20:12.000+0100},
title = {Random Walks on Complex Networks},
url = {doi:10.1103/PhysRevLett.92.118701},
volume = 92,
year = 2004
}