Stochastic Search with Poisson and Deterministic Resetting
arXiv:1605.08812 · doi:10.1088/1742-5468/2016/08/083401
Abstract
We investigate a stochastic search process in one, two, and three dimensions in which diffusing searchers that all start at seek a target at the origin. Each of the searchers is also reset to its starting point, either with rate , or deterministically, with a reset time . In one dimension and for a small number of searchers, the search time and the search cost are minimized at a non-zero optimal reset rate (or time), while for sufficiently large , resetting always hinders the search. In general, a single searcher leads to the minimum search cost in one, two, and three dimensions. When the resetting is deterministic, several unexpected feature arise for searchers, including the search time being independent of for and the search cost being independent of over a suitable range of . Moreover, deterministic resetting typically leads to a lower search cost than in stochastic resetting.
23 pages, 9 figures, IOP format. Revised version: figure added, introductory text added, references added, and various minor changes incorporated. V3: Final version to appear in JSTAT. A few more references added
References in corpus (8)
- Diffusion in a potential landscape with stochastic resetting
- Random walks with preferential relocations to places visited in the past and their application to biology
- Bidimensional intermittent search processes: an alternative to Levy flights strategies
- First passages for a search by a swarm of independent random searchers
- Monotonous continuous-time random walks with drift and stochastic reset events
- Mortality, Redundancy, and Diversity in Stochastic Search
- Depletion-Controlled Starvation of a Diffusing Forager
- Optimal search strategies of space-time coupled random walkers with finite lifetimes