Optimality of spatially inhomogeneous search strategies
arXiv:1602.00509 · doi:10.1103/PhysRevLett.117.068101
Abstract
We consider random search processes alternating stochastically between diffusion and ballistic motion, in which the distribution function of ballistic motion directions varies from point to point in space. The specific space dependence of the directional distribution together with the switching rates between the two modes of motion establishes a spatially inhomogeneous search strategy. We show that the mean first passage times for several standard search problems - narrow escape, reaction partner finding, reaction-escape - can be minimized with a directional distribution that is reminiscent of the spatial organization of the cytoskeleton filaments of cells with a centrosome: radial ballistic transport from center to periphery and back, and ballistic transport in random directions within a concentric shell of thickness along the domain boundary. The results suggest that living cells realize efficient search strategies for various intracellular transport problems economically through a spatial cytoskeleton organization that involves radial microtubules in the central region and only a narrow actin cortex rather than a cell body filled with randomly oriented actin filaments.
arXiv comment9 pages, 6 figures (including supplementary material), published version
References in corpus (19)
- Diffusion with Stochastic Resetting
- Intermittent search strategies
- First-passage times in complex scale-invariant media
- Geometry-controlled kinetics
- First order transition for the optimal search time of Lévy flights with resetting
- Optimal search strategies for hidden targets
- Optimal target search on a fast folding polymer chain with volume exchange
- Probing microscopic origins of confined subdiffusion by first-passage observables
- Enhanced reaction kinetics in biological cells
- First-passage times for random walks in bounded domains
- First passages for a search by a swarm of independent random searchers
- Optimal reaction time for surface-mediated diffusion
- Survival of an evasive prey
- Robustness of optimal intermittent search strategies in dimension 1, 2 and 3
- Optimizing persistent random searches
- Searching fast for a target on a DNA without falling to traps
- Facilitated diffusion of proteins on chromatin
- Efficient kinetic Monte Carlo method for reaction-diffusion processes with spatially varying annihilation rates
- Random Walks on Complex Networks
Cited by in corpus (11)
- Persistence-Speed Coupling Enhances the Search Efficiency of Migrating Immune Cells
- Spatial cytoskeleton organization supports targeted intracellular transport
- Spatial Organization of the Cytoskeleton enhances Cargo Delivery to Specific Target Areas on the Plasma Membrane of Spherical Cells
- Chemokinetic scattering, trapping, and avoidance of active Brownian particles
- Numerical analysis of homogeneous and inhomogeneous intermittent search strategies
- The narrow escape problem in a circular domain with radial piecewise constant diffusivity
- Narrow escape problem in two-shell spherical domains
- Topology-dependent density optima for efficient simultaneous network exploration
- Stochastic 1D search-and-capture as a G/M/c queueing model
- Cytoskeletal filament length controlled dynamic sequestering of intracellular cargo
- Universal Linear Response of First-Passage Kinetics: A Framework for Prediction and Inference