Random Walks on Complex Networks
| dc.creator | Noh, Jae Dong | |
| dc.creator | Rieger, Heiko | |
| dc.date | 2003-07-30 | |
| dc.date | 2004-03-19 | |
| dc.date.accessioned | 2026-07-07T02:52:40Z | |
| dc.date.available | 2026-07-07T02:52:40Z | |
| dc.description | 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. | |
| dc.description | published version (4 pages, 2 eps figures) | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0307719 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0307719 | |
| dc.identifier | Phys. Rev. Lett. 92, 118701 (2004) | |
| dc.identifier | doi:10.1103/PhysRevLett.92.118701 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/21924 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Random Walks on Complex Networks | |
| dc.type | text |