Random walks on complex networks with multiple resetting nodes: a renewal approach

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.

arXiv comment11 pages, 4 figures

References in corpus (51)

• Emergence of scaling in random networks
• Community detection in graphs
• Understanding individual human mobility patterns
• Maps of random walks on complex networks reveal community structure
• Epidemic processes in complex networks
• Vital nodes identification in complex networks
• Human Mobility: Models and Applications
• Reaction-diffusion processes and metapopulation models in heterogeneous networks
• Diffusion with Stochastic Resetting
• Intermittent search strategies
• Voter Model on Heterogeneous Graphs
• Random walks and diffusion on networks
• Stochastic Resetting and Applications
• Persistence and First-Passage Properties in Non-equilibrium Systems
• Diffusion with Optimal Resetting
• First Passage Under Restart
• Experimental realization of diffusion with stochastic resetting
• Diffusion under time-dependent resetting
• Run and tumble particle under resetting: a renewal approach
• 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
• Global mean first-passage times of random walks on complex networks
• Fluctuating interfaces subject to stochastic resetting
• Natural human mobility patterns and spatial spread of infectious diseases
• The Michaelis-Menten reaction scheme as a unified approach towards the optimal restart problem
• WKB theory of large deviations in stochastic populations
• First passage time for random walks in heterogeneous networks
• Google matrix analysis of directed networks
• Stochastic thermodynamics of resetting
• Large deviations for Markov processes with resetting
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Random walks on weighted networks
• First passage of a particle in a potential under stochastic resetting: a vanishing transition of optimal resetting rate
• Work fluctuations and Jarzynski equality in stochastic resetting
• Characteristic times of biased random walks on complex networks
• Random walks on networks with stochastic resetting
• Integral Fluctuation Theorems for Stochastic Resetting Systems
• Symmetric Exclusion Process under Stochastic Resetting
• Stochastic resetting with stochastic returns using external trap
• Ising model with stochastic resetting
• Epidemic extinction and control in heterogeneous networks
• Spectral properties of simple classical and quantum reset processes
• Run-and-Tumble particles in Two-dimensions under Stochastic Resetting
• Mean first-passage time for random walks on undirected networks
• Active Brownian Motion in two-dimensions under Stochastic Resetting
• Mean first passage time of active Brownian particle in one dimension
• Occupation time of a run-and-tumble particle with resetting
• Random walks on complex networks with first-passage resetting
• From classical to quantum walks with stochastic resetting on networks
• Exploring complex networks by means of adaptive walkers

Cited by in corpus (7)

• The inspection paradox in stochastic resetting
• Random walks on complex networks under node-dependent stochastic resetting
• Random walks on complex networks under time-dependent stochastic resetting
• Entropy rate of random walks on complex networks under stochastic resetting
• Stochastic resetting with refractory periods: pathway formulation and exact results
• First passage in discrete-time absorbing Markov chains under stochastic resetting
• Unexpected advantages of exploitation for target searches in complex networks