Numerical analysis of homogeneous and inhomogeneous intermittent search strategies

Abstract

A random search is a stochastic process representing the random motion of a particle (denoted as the searcher) that is terminated when it reaches (detects) a target particle or area the first time. In intermittent search the random motion alternates between two or more motility modes, one of which is non-detecting. An example is the slow diffusive motion as the detecting mode and fast, directed ballistic motion as the non-detecting mode, which can lead to much faster detection than a purely diffusive search. The transition rate between the diffusive and the ballistic mode (and back) together with the probability distribution of directions for the ballistic motion defines a search strategy. If these transition rates and/or probability distributions depend on the spatial coordinates within the search domain it is a spatially inhomogeneous search strategy, if both are constant, it is a homogeneous one. Here we study the efficiency, measured in terms of the mean first-passage time, of spatially homogeneous and inhomogeneous search strategies for three paradigmatic search problems: 1) the narrow escape problem, where the searcher has to find a small area on the boundary of the search domain, 2) reaction kinetics, which involves the detection of an immobile target in the interior of a search domain, and 3) the reaction-escape problem, where the searcher first needs to find a diffusive target before it can escape through a narrow region on the boundary. Using families of spatially inhomogeneous search strategies, partially motivated by the spatial organization of the cytoskeleton in living cells with a centrosome, we show that they can be made almost always more efficient than homogeneous strategies.

arXiv comment31 pages, 29 figures

References in corpus (18)

• Diffusion with Stochastic Resetting
• Intermittent search strategies
• First order transition for the optimal search time of Lévy flights with resetting
• Optimal search strategies for hidden targets
• Persistent Cell Motion in the Absence of External Signals: A Search Strategy for Eukaryotic Cells
• Enhanced reaction kinetics in biological cells
• First passages in bounded domains: When is the mean first passage time meaningful?
• Optimal reaction time for surface-mediated diffusion
• Robustness of optimal intermittent search strategies in dimension 1, 2 and 3
• First-Passage Kinetic Monte Carlo method
• Capture of the Lamb: Diffusing Predators Seeking a Diffusing Prey
• Optimizing persistent random searches
• A First-Passage Kinetic Monte Carlo Algorithm for Complex Diffusion-Reaction Systems
• Kinetics of a Diffusive Capture Process: Lamb Besieged by a Pride of Lions
• Averaged residence times of stochastic motions in bounded domains
• Life and Death in a Cage and at the Edge of a Cliff
• Optimality of spatially inhomogeneous search strategies
• Efficient kinetic Monte Carlo method for reaction-diffusion processes with spatially varying annihilation rates

Cited by in corpus (6)

• Spatial cytoskeleton organization supports targeted intracellular transport
• Hunting active Brownian particles: Learning optimal behavior
• Chemokinetic scattering, trapping, and avoidance of active Brownian particles
• The narrow escape problem in a circular domain with radial piecewise constant diffusivity
• Narrow escape problem in two-shell spherical domains
• Narrow Escape Brownian Dynamics Modeling in the Three-Dimensional Unit Sphere