PubMed · 15089179
Random walks on complex networks.
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jae Dong Noh, Heiko Rieger. 2004-03-18. Random walks on complex networks.. https://doi.org/10.1103/physrevlett.92.118701. https://pubmed.health/record/pubmed%3A15089179/random-walks-on-complex-networks
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite PubMed Health by Indiciae: BibTeX · RIS.