Optimizing Leapover Lengths of Lévy Flights with Resetting
arXiv:2403.12727 · doi:10.1103/PhysRevE.110.L022103
Abstract
We consider a one-dimensional search process under stochastic resetting conditions. A target is located at and a searcher, starting from the origin, performs a discrete-time random walk with independent jumps drawn from a heavy-tailed distribution. Before each jump, there is a given probability of restarting the walk from the initial position. The efficiency of a "myopic search" - in which the search stops upon crossing the target for the first time - is usually characterized in terms of the first-passage time . On the other hand, great relevance is encapsulated by the leapover length , which measures how far from the target the search ends. For symmetric heavy-tailed jump distributions, in the absence of resetting the average leapover is always infinite. Here we show instead that resetting induces a finite average leapover if the mean jump length is finite. We compute exactly and determine the condition under which resetting allows for nontrivial optimization, i.e., for the existence of such that is minimal and smaller than the average leapover of the single jump.
5 pages, 2 figures
References in corpus (10)
- The scaling laws of human travel
- First Passage Under Restart
- First order transition for the optimal search time of Lévy flights with resetting
- Optimal mean first-passage time for a Brownian searcher subjected to resetting: experimental and theoretical results
- Leapover lengths and first passage time statistics for Lévy flights
- First-passage and first-hitting times of Levy flights and Levy walks
- Unified Solution of the Expected Maximum of a Random Walk and the Discrete Flux to a Spherical Trap
- On the Gap and Time Interval between the First Two Maxima of Long Random Walks
- First passage time moments of asymmetric Lévy flights
- Fast rare events in exit times distributions of jump processes