Random Walks on Complex Networks

Jae Dong Noh, Heiko Rieger

Research output: Contribution to journalArticlepeer-review

904 Scopus citations

Abstract

Random walks on complex networks was investigated to derive an exact expression for the mean first-passage time (MFPT) between two modes. The random walk centrality C, which is the ratio between its coordination number and a characterstic relaxation time was introduced for each mode. It was shown that MFPT is determined by C. The relative speed by which a node receives and spreads information over the network in a random process was determined by the centrality of the node. The analysis was confirmed by the numerical simulations of an ensemble of random walkers moving on paradigmatic network models.

Original languageEnglish
Article number118701
Pages (from-to)118701-1-118701-4
JournalPhysical Review Letters
Volume92
Issue number11
DOIs
StatePublished - 19 Mar 2004

Fingerprint

Dive into the research topics of 'Random Walks on Complex Networks'. Together they form a unique fingerprint.

Cite this