Optimality of spatially inhomogeneous search strategies (1602.00509v2)
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 $\Delta_{\rm opt}$ 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.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.