Optimizing the random search of a finite-lived target by a Lévy flight

Abstract

In many random search processes of interest in chemistry, biology or during rescue operations, an entity must find a specific target site before the latter becomes inactive, no longer available for reaction or lost. We present exact results on a minimal model system, a one-dimensional searcher performing a discrete time random walk or Lévy flight. In contrast with the case of a permanent target, the capture probability and the conditional mean first passage time can be optimized. The optimal Lévy index takes a non-trivial value, even in the long lifetime limit, and exhibits an abrupt transition as the initial distance to the target is varied. Depending on the target lifetime, this transition is discontinuous or continuous, separated by a non-conventional tricritical point. These results pave the way to the optimization of search processes under time constraints.

arXiv commentSupplementary material can be found at the end of the main document

References in corpus (38)

• Diffusion with Stochastic Resetting
• Intermittent search strategies
• Stochastic Resetting and Applications
• Persistence and First-Passage Properties in Non-equilibrium Systems
• Diffusion with Optimal Resetting
• First Passage Under Restart
• First order transition for the optimal search time of Lévy flights with resetting
• Optimal stochastic restart renders fluctuations in first passage times universal
• Experimental realization of diffusion with stochastic resetting
• Diffusion under time-dependent resetting
• Optimal mean first-passage time for a Brownian searcher subjected to resetting: experimental and theoretical results
• Diffusion with resetting in arbitrary spatial dimension
• Review of Inverse Laplace Transform Algorithms for Laplace-Space Numerical Approaches
• Stochastic resetting in backtrack recovery by RNA polymerases
• Universal First-passage Properties of Discrete-time Random Walks and Levy Flights on a Line: Statistics of the Global Maximum and Records
• Stochastic Search with Poisson and Deterministic Resetting
• Restart could optimize the probability of success in a Bernoulli trial
• Mortality, Redundancy, and Diversity in Stochastic Search
• Landau theory of restart transitions
• Localization transition induced by learning in random searches
• Phase transitions in optimal search times: how random walkers should combine resetting and flight scales
• Precise Asymptotics for a Random Walker's Maximum
• Exploration and Trapping of Mortal Random Walkers
• Search and rescue at sea aided by hidden flow structures
• Sisyphus random walk
• Intermittent resetting potentials
• Intermittent random walks for an optimal search strategy: One-dimensional case
• Inverse square Lévy walks are not optimal search strategies for $d\ge 2$
• Intermittent Inverse-Square Lévy Walks are Optimal for Finding Targets of All Sizes
• Survival Probability of Random Walks and Lévy Flights on a Semi-Infinite Line
• Splitting Probabilities of Jump Processes
• Diffusive search for a stochastically-gated target with resetting
• Modulation of DNA loop lifetimes by the free energy of loop formation
• Reducing mean first passage times with intermittent confining potentials: a realization of resetting processes
• Comment on "Inverse Square Lévy Walks are not Optimal Search Strategies for d $\ge$ 2" [Phys. Rev. Lett. 124, 080601 (2020)]
• Reply to Comment on "Inverse Square Lévy Walks are not Optimal Search Strategies for d \geq 2 "
• Critical number of walkers for diffusive search processes with resetting
• Effects of mortality on stochastic search processes with resetting

Cited by in corpus (1)

• Optimal conditions for first passage of jump processes with resetting