Random walks on complex networks under time-dependent stochastic resetting
arXiv:2208.06212 · doi:10.1103/PhysRevE.106.044139
Abstract
We study discrete-time random walks on networks subject to a time-dependent stochastic resetting, where the walker either hops randomly between neighboring nodes with a probability , or is reset to a given node with a complementary probability . The resetting probability depends on the time since the last reset event (also called the age of the walker). Using the renewal approach and spectral decomposition of transition matrix, we formulize the stationary occupation probability of the walker at each node and the mean first passage time between arbitrary two nodes. Concretely, we consider that two different time-dependent resetting protocols that are both exactly solvable. One is that is a step-shaped function of and the other one is that is a rational function of . We demonstrate the theoretical results on two different networks, also validated by numerical simulations, and find that the time-modulated resetting protocols can be more advantageous than the constant-probability resetting in accelerating the completion of a target search process.
10 pages, 3 figures. arXiv admin note: text overlap with arXiv:2105.08323
References in corpus (37)
- 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
- Experimental realization of diffusion with stochastic resetting
- 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
- Random walks with preferential relocations to places visited in the past and their application to biology
- Random walks on weighted networks
- The inspection paradox in stochastic resetting
- Optimization in First-Passage Resetting
- Integral Fluctuation Theorems for Stochastic Resetting Systems
- Stochastic resetting with stochastic returns using external trap
- Ising model with stochastic resetting
- Run-and-Tumble particles in Two-dimensions under Stochastic Resetting
- First passage under restart for discrete space and time: application to one dimensional confined lattice random walks
- Active Brownian Motion in two-dimensions under Stochastic Resetting
- Extremal statistics for stochastic resetting systems
- Occupation time of a run-and-tumble particle with resetting
- Mean perimeter and area of the convex hull of a planar Brownian motion in the presence of resetting
- Record statistics for random walks and Lévy flights with resetting
- Stochastic resetting on comb-like structures
- Diffusive transport on networks with stochastic resetting to multiple nodes
- First-passage Brownian functionals with stochastic resetting
- Number of distinct sites visited by a resetting random walker
- Phase transition in non-Markovian animal exploration model with preferential returns
- Random walks on complex networks with first-passage resetting
- From classical to quantum walks with stochastic resetting on networks
- Random walks on complex networks under node-dependent stochastic resetting
- First passage of a diffusing particle under stochastic resetting in bounded domains with spherical symmetry
- Maximum and records of random walks with stochastic resetting
- Drift-diffusion on a Cayley tree with stochastic resetting: the localization-delocalization transition
- Random walks on complex networks with multiple resetting nodes: a renewal approach
- Discrete-time random walks and Lévy flights on arbitrary networks: when resetting becomes advantageous?
- Random Walks on Complex Networks