Random search with resetting in heterogeneous environments
Luiz Menon, Celia Anteneodo
TL;DR
This work addresses mean first-passage times for stochastic searches with resetting in a bounded 1D environment with space-dependent diffusivity $D(x)$. It develops a backward-Fokker-Planck framework to obtain MFPT expressions, delivering an exact closed form for arbitrary $D(x)$ in the Stratonovich interpretation and asymptotic results for Itô and anti-Itô, complemented by closed forms for linear $D(x)$. The authors also analyze non-monotonic diffusivity (e.g., oscillatory $D(x)$) and extend the treatment to two absorbing boundaries and the semi-infinite limit, revealing how heterogeneity and the interpretation of multiplicative noise shape resetting efficiency. Overall, resetting can substantially reduce the MFPT when diffusivity is higher near the target, while highly oscillatory heterogeneity can diminish resetting benefits, with the effects further modulated by reset location and domain size.
Abstract
We investigate random searches under stochastic position resetting at rate $r$, in a bounded 1D environment with space-dependent diffusivity $D(x)$. For arbitrary shapes of $D(x)$ and prescriptions of the associated multiplicative stochastic process, we obtain analytical expressions for the average time $T$ for reaching the target (mean first-passage time), given the initial and reset positions, in good agreement with stochastic simulations. For arbitrary $D(x)$, we obtain an exact closed-form expression for $T$, within Stratonovich scenario, while for other prescriptions, like Itô and anti-Itô, we derive asymptotic approximations for small and large rates $r$. Exact results are also obtained for particular forms of $D(x)$, such as the linear one, with arbitrary prescriptions, allowing to outline and discuss the main effects introduced by diffusive heterogeneity on a random search with resetting. We explore how the effectiveness of resetting varies with different types of heterogeneity.
