Cargando…

A scaling law for random walks on networks

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Perkins, Theodore J., Foxall, Eric, Glass, Leon, Edwards, Roderick
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Pub. Group 2014
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4214407/
https://www.ncbi.nlm.nih.gov/pubmed/25311870
http://dx.doi.org/10.1038/ncomms6121
Descripción
Sumario: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.