Optimizing persistent random searches

Abstract

We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial minimum as function of the persistence length. This reveals an optimal search strategy which differs markedly from the simple ballistic motion obtained in the case of Poisson distributed targets. Our results show that the distribution of targets plays a crucial role in the random search problem. In particular, in the biologically relevant cases of either a single target or regular patterns of targets, we find that, in strong contrast with repeated statements in the literature, persistent random walks with exponential distribution of excursion lengths can minimize the search time, and in that sense perform better than any Levy walk.

4 pages, 4 figures

References in corpus (8)

• Intermittent search strategies
• First-passage times in complex scale-invariant media
• Bidimensional intermittent search processes: an alternative to Levy flights strategies
• Intermittent random walks for an optimal search strategy: One-dimensional case
• Exact expressions of mean first-passage times and splitting probabilities for random walks in bounded rectangular domains
• Diffusive properties of persistent walks on cubic lattices with application to periodic Lorentz gases
• Residual mean first-passage time for jump processes: theory and applications to Lévy flights and fractional Brownian motion
• Collision number statistics for transport processes

Cited by in corpus (46)

• Lévy walks
• Random walks and diffusion on networks
• Diffusion under time-dependent resetting
• Run and tumble particle under resetting: a renewal approach
• Universal survival probability for a $d$-dimensional run-and-tumble particle
• Inverse square Lévy walks are not optimal search strategies for $d\ge 2$
• Analytic Solution of an Active Brownian Particle in a Harmonic Well
• Flagellar number governs bacterial spreading and transport efficiency
• Optimal search strategies of run-and-tumble walks
• Optimal non-Markovian search strategies with n-step memory
• Splitting Probabilities of Jump Processes
• Persistence-Speed Coupling Enhances the Search Efficiency of Migrating Immune Cells
• Universal First-Passage-Time Distribution of Non-Gaussian Currents
• Optimization of random search processes in the presence of an external bias
• Optimality of spatially inhomogeneous search strategies
• Active Brownian Particles in a Circular Disk with an Absorbing Boundary
• Does Greed Help a Forager Survive?
• Multitarget search on complex networks: A logarithmic growth of global mean random cover time
• Optimal mean first-passage time of a run-and-tumble particle in a class of one-dimensional confining potentials
• Joint statistics of space and time exploration of $1d$ random walks
• Run-and-tumble particle in one-dimensional potentials: mean first-passage time and applications
• Relating absorbing and hard wall boundary conditions for a one-dimensional run-and-tumble particle
• Density functionals and Kohn-Sham potentials with minimal wavefunction preparations on a quantum computer
• Distinct Speed and Direction Memories of Migrating Dendritic Cells Diversify Their Search Strategies
• Random Search with Memory in Patchy Media: Exploration-Exploitation Tradeoff
• Self-reinforcing directionality generates Lévy walks without the power-law assumption
• Mean cover time of one-dimensional persistent random walks
• Universal cover-time distribution of heterogeneous random walks
• Optimal foraging strategies can be learned
• Starvation Dynamics of a Greedy Forager
• Numerical analysis of homogeneous and inhomogeneous intermittent search strategies
• Population heterogeneity in the fractional master equation, ensemble self-reinforcement and strong memory effects
• Stochastic resetting prevails over sharp restart for broad target distributions
• Persistent and anti-Persistent Motion in Bounded and Unbounded Space: Resolution of the First-Passage Problem
• Target Searches of Interacting Brownian Particles
• Leftward, Rightward and Complete Exit Time Distributions of Jump Processes
• How images determine our visual search strategy
• The balance of growth and risk in population dynamics
• Siegmund duality for physicists: a bridge between spatial and first-passage properties of continuous and discrete time stochastic processes
• Mean first-passage time of an anisotropic diffusive searcher
• Stochastic Resetting Mitigates Latent Gradient Bias of SGD from Label Noise
• Policy heterogeneity improves collective olfactory search in 3-D turbulence
• Two-Dimensional Active Brownian Particles Crossing a Parabolic Barrier: Transition-Path Times, Survival Probability, and First-Passage Time
• Multi-target search in bounded and heterogeneous environments: a lattice random walk perspective
• Two-Dimensional Active Brownian Particles Crossing a Parabolic Barrier: Finite Rectangular Domain with Absorbing Boundary Conditions
• A dimensional acceleration of gradient descent-like methods, using persistent random walkers