Diffusive transport on networks with stochastic resetting to multiple nodes.

@article{Gonzalez2021DiffusiveTO,
  title={Diffusive transport on networks with stochastic resetting to multiple nodes.},
  author={Fernanda H. Gonz'alez and Alejandro P. Riascos and Denis Boyer},
  journal={Physical review. E},
  year={2021},
  volume={103 6-1},
  pages={
          062126
        }
}
We study the diffusive transport of Markovian random walks on arbitrary networks with stochastic resetting to multiple nodes. We deduce analytical expressions for the stationary occupation probability and for the mean and global first passage times. This general approach allows us to characterize the effect of resetting on the capacity of random walk strategies to reach a particular target or to explore the network. Our formalism holds for ergodic random walks and can be implemented from the… 

Figures from this paper

Random walks on weighted networks: a survey of local and non-local dynamics
TLDR
A survey of different types of random walk models with local and non-local transitions on undirected weighted networks by defining the dynamics as a discrete-time Markovian process with transition probabilities expressed in terms of a symmetric matrix of weights.
The inspection paradox in stochastic resetting
The remaining travel time of a plane shortens with every minute that passes from its departure, and a flame diminishes a candle with every second it burns. Such everyday occurrences bias us to think

References

SHOWING 1-10 OF 22 REFERENCES
Graph Spectra for Complex Networks
TLDR
This self-contained book provides a concise introduction to the theory of graph spectra and its applications to the study of complex networks, and the general properties of both the adjacency and Laplacian spectrum of graphs are derived and applied to complex networks.
Random Walks and Random Environments: Vol. 1: Random Walks (Oxford
  • 1995
  • 2016
Algorithms and Models for the Web Graph
TLDR
It is argued that the network is robust if τ < 2+ 1 δ , but fails to be robust ifτ > 2 + 1 ε−1 .
Network science (Cambridge University Press, Cambridge, 2016)
  • 2016
  • 2014
  • 2014
Mining of Massive Datasets, 2nd Ed
Sokol, in Algorithms and Models for the Web Graph, edited
  • 2014
...
1
2
3
...