Journal
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT
Volume -, Issue -, Pages -Publisher
IOP PUBLISHING LTD
DOI: 10.1088/1742-5468/2016/08/083401
Keywords
stochastic search; stochastic processes; Brownian motion; diffusion
Categories
Funding
- National Science Foundation [DMR-1623243]
- John Templeton Foundation
- United States Israel Binational Science Foundation [2012145]
- Division Of Materials Research
- Direct For Mathematical & Physical Scien [1623243] Funding Source: National Science Foundation
Ask authors/readers for more resources
We investigate a stochastic search process in one, two, and three dimensions in which N di. using searchers that all start at x(0) seek a target at the origin. Each of the searchers is also reset to its starting point, either with rate r, or deterministically, with a reset time T. 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 suffciently large N, 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 N searchers, including the search time being independent of T for 1/T -> 0 and the search cost being independent of N over a suitable range of N. Moreover, deterministic resetting typically leads to a lower search cost than in Poisson resetting.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available