Diffusive transport on networks with stochastic resetting to multiple nodes

Abstract

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 spectral properties of the random walk without resetting, providing a tool to analyze the efficiency of search strategies with resetting to multiple nodes. We apply the methods developed here to the dynamics with two reset nodes and derive analytical results for normal random walks and Lévy flights on rings. We also explore the effect of resetting to multiple nodes on a comb graph, Lévy flights that visit specific locations in a continuous space, and the Google random walk strategy on regular networks.

17 pages, 6 figures

References in corpus (11)

• First Passage Under Restart
• First order transition for the optimal search time of Lévy flights with resetting
• Optimal mean first-passage time for a Brownian searcher subjected to resetting: experimental and theoretical results
• Dynamical transition in the temporal relaxation of stochastic processes under resetting
• Stochastic Search with Poisson and Deterministic Resetting
• Monotonous continuous-time random walks with drift and stochastic reset events
• Long-Range Navigation on Complex Networks using Lévy Random Walks
• Fractional dynamics on networks: Emergence of anomalous diffusion and Lévy flights
• First passage under restart for discrete space and time: application to one dimensional confined lattice random walks
• Fractional random walk lattice dynamics
• Random Walks on Complex Networks

Cited by in corpus (20)

• The inspection paradox in stochastic resetting
• Diffusion with Partial Resetting
• Number of distinct sites visited by a resetting random walker
• Random walks on complex networks with first-passage resetting
• Random walks on complex networks under node-dependent stochastic resetting
• Resetting mediated navigation of active Brownian searcher in a homogeneous topography
• Random walks on complex networks under time-dependent stochastic resetting
• First passage time and information of a one-dimensional Brownian particle with stochastic resetting to random positions
• Diffusion with two resetting points
• Random walks with stochastic resetting in complex networks: a discrete time approach
• Discrete-time random walks and Lévy flights on arbitrary networks: when resetting becomes advantageous?
• Biased random walk on random networks in presence of stochastic resetting: Exact results
• Entropy rate of random walks on complex networks under stochastic resetting
• Optimal conditions for first passage of jump processes with resetting
• First passage in discrete-time absorbing Markov chains under stochastic resetting
• Totally asymmetric simple exclusion process with local resetting and open boundary conditions
• Unexpected advantages of exploitation for target searches in complex networks
• Mean first-encounter times of simultaneous random walkers with resetting on networks
• A measure of dissimilarity between diffusive processes on networks
• Abrupt transitions in the optimization of diffusion with distributed resetting