Random walks on complex networks with multiple resetting nodes: a renewal approach
arXiv:2105.08323 · doi:10.1063/5.0064791
Abstract
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting nodes. Using a renewal approach, we derive exact expressions of the occupation probability of the walker in each node and mean-field first-passage time between arbitrary two nodes. All the results are relevant to the spectral properties of the transition matrix in the absence of resetting. We demonstrate our results on circular networks, stochastic block models, and Barabási-Albert scale-free networks, and find the advantage of the resetting processes to multiple resetting nodes in global searching on such networks.
11 pages, 4 figures
References in corpus (11)
- Understanding individual human mobility patterns
- Maps of random walks on complex networks reveal community structure
- Vital nodes identification in complex networks
- Reaction-diffusion processes and metapopulation models in heterogeneous networks
- First Passage Under Restart
- Diffusion in a potential landscape with stochastic resetting
- Optimal mean first-passage time for a Brownian searcher subjected to resetting: experimental and theoretical results
- Diffusion with resetting in arbitrary spatial dimension
- Exact solution for mean first-passage time on a pseudofractal scale-free web
- Random walks on weighted networks
- Integral Fluctuation Theorems for Stochastic Resetting Systems