Searching for clusters of targets under stochastic resetting
arXiv:2111.02335 · doi:10.1140/epjb/s10051-021-00238-0
Abstract
We consider diffusion under stochastic resetting to the origin in one dimension and compute the mean time to find both of two targets placed either side of the origin. A surprising result is that increasing the distance between two targets can decrease the overall search time. We compute the optimal arrangement of two targets in limiting cases. We generalise to obtain recursive expressions for the mean time to find all of multiple targets. We discuss the relevance to real-world problems of locating multiple targets such as proteins locating clusters of DNA lesions.
arXiv comment9 pages, 3 figures, accepted for European Physical Journal B
References in corpus (20)
- Diffusion with Stochastic Resetting
- Intermittent search strategies
- Stochastic Resetting and Applications
- Persistence and First-Passage Properties in Non-equilibrium Systems
- Diffusion with Optimal Resetting
- Optimal search strategies for hidden targets
- Optimal stochastic restart renders fluctuations in first passage times universal
- Experimental realization of diffusion 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
- First passage under stochastic resetting in an interval
- Boosting search by rare events
- Restart could optimize the probability of success in a Bernoulli trial
- Resetting processes with non-instanteneous return
- Effects of refractory period on stochastic resetting
- Landau theory of restart transitions
- Searching fast for a target on a DNA without falling to traps
- Effect of Partial Absorption on Diffusion with Resetting
- Diffusion with stochastic resetting is invariant to return speed
- Optimal random search for a single hidden target