A scaling law for random walks on networks
| dc.contributor.author | Perkins, T.J. | |
| dc.contributor.author | Foxall, E. | |
| dc.contributor.author | Glass, L. | |
| dc.contributor.author | Edwards, Roderick | |
| dc.date.accessioned | 2021-08-05T22:39:05Z | |
| dc.date.available | 2021-08-05T22:39:05Z | |
| dc.date.copyright | 2014 | en_US |
| dc.date.issued | 2014 | |
| dc.description.abstract | The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics. | en_US |
| dc.description.reviewstatus | Reviewed | en_US |
| dc.description.scholarlevel | Faculty | en_US |
| dc.description.sponsorship | We are indebted to Riccardo Scalco and Amedeo Caflisch for contributing the G-protein network model to our study, and for additional discussions of energy calculations for that model. We thank Peter Swain and Johannes Jaeger for reading earlier drafts of this manuscript. This work was supported in part by grants from the National Science and Engineering Research Council of Canada to T.J.P., R.E. and L.G. | en_US |
| dc.identifier.citation | Perkins, T.J., Foxall, E., Glass, L., & Edwards, R. (2014). A scaling law for random walks on networks. Nature Communications, 5. https://doi.org/10.1038/ncomms6121 | en_US |
| dc.identifier.uri | https://doi.org/10.1038/ncomms6121 | |
| dc.identifier.uri | http://hdl.handle.net/1828/13213 | |
| dc.language.iso | en | en_US |
| dc.publisher | Nature Communications | en_US |
| dc.subject | biological physics | en_US |
| dc.subject | networks and systems biology | en_US |
| dc.subject | scaling laws | en_US |
| dc.title | A scaling law for random walks on networks | en_US |
| dc.type | Article | en_US |