English

Diffusive Search with spatially dependent Resetting

Probability 2018-12-04 v4

Abstract

Consider a stochastic search model with resetting for an unknown stationary target aRa\in\mathbb{R} with known distribution μ\mu. The searcher begins at the origin and performs Brownian motion with diffusion constant DD. The searcher is also armed with an exponential clock with spatially dependent rate rr, so that if it has failed to locate the target by the time the clock rings, then its position is reset to the origin and it continues its search anew from there. Denote the position of the searcher at time tt by X(t)X(t). Let E0(r)E_0^{(r)} denote expectations for the process X()X(\cdot). The search ends at time Ta=inf{t0:X(t)=a}T_a=\inf\{t\ge0:X(t)=a\}. The expected time of the search is then R(E0(r)Ta)μ(da)\int_{\mathbb{R}}(E_0^{(r)}T_a)\thinspace\mu(da). Ideally, one would like to minimize this over all resetting rates rr. We obtain quantitative growth rates for E0(r)TaE_0^{(r)}T_a as a function of aa in terms of the asymptotic behavior of the rate function rr, and also a rather precise dichotomy on the asymptotic behavior of the resetting function rr to determine whether E0(r)TaE_0^{(r)}T_a is finite or infinite. We show generically that if r(x)r(x) is on the order x2l|x|^{2l}, with l>1l>-1, then logE0(r)Ta\log E_0^{(r)}T_a is on the order al+1|a|^{l+1}; in particular, the smaller the asymptotic size of rr, the smaller the asymptotic growth rate of E0(r)TaE_0^{(r)}T_a. The asymptotic growth rate of E0(r)TaE_0^{(r)}T_a continues to decrease when r(x)Dλx2r(x)\sim \frac{D\lambda}{x^2} with λ>1\lambda>1; now the growth rate of E0(r)TaE_0^{(r)}T_a is more or less on the order a1+1+8λ2|a|^{\frac{1+\sqrt{1+8\lambda}}2}. However, if λ=1\lambda=1, then E0(r)Ta=E_0^{(r)}T_a=\infty, for a0a\neq0.

Keywords

Cite

@article{arxiv.1805.00320,
  title  = {Diffusive Search with spatially dependent Resetting},
  author = {Ross G. Pinsky},
  journal= {arXiv preprint arXiv:1805.00320},
  year   = {2018}
}

Comments

A bit of numerical work has been included. A few minor errors have been cleared up

R2 v1 2026-06-23T01:41:31.011Z