Persistence-Speed Coupling Enhances the Search Efficiency of Migrating Immune Cells
arXiv:2006.06030 · doi:10.1103/PhysRevLett.125.268102
Abstract
Migration of immune cells within the human body allows them to fulfill their main function of detecting pathogens. Adopting an optimal navigation and search strategy by these cells is of crucial importance to achieve an efficient immune response. Analyzing the dynamics of dendritic cells in our in vitro experiments reveals that the directional persistence of these cells is highly correlated with their migration speed, and that the persistence-speed coupling enables the migrating cells to reduce their search time. We introduce theoretically a new class of random search optimization problems by minimizing the mean first-passage time (MFPT) with respect to the strength of the coupling between influential parameters such as speed and persistence length. We derive an analytical expression for the MFPT in a confined geometry and verify that the correlated motion improves the search efficiency if the mean persistence length is sufficiently shorter than the confinement size. In contrast, a positive persistence-speed correlation even increases the MFPT at long persistence length regime, thus, such a strategy is disadvantageous for highly persistent active agents.
arXiv comment6 pages, 4 figures
References in corpus (22)
- 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
- Optimal target search on a fast folding polymer chain with volume exchange
- Enhanced reaction kinetics in biological cells
- First-passage times for random walks in bounded domains
- Mean first-passage times of non-Markovian random walkers in confinement
- Bacteria display optimal transport near surfaces -- bacteria as intermittent active chiral particles: trapped by hydrodynamics, escaping by adhesion
- Survival of an evasive prey
- Occupation times of random walks in confined geometries: From random trap model to diffusion limited reactions
- Robustness of optimal intermittent search strategies in dimension 1, 2 and 3
- Optimizing persistent random searches
- Optimized Diffusion of Run-and-Tumble Particles in Crowded Environments
- Inverse square Lévy walks are not optimal search strategies for
- Flagellar number governs bacterial spreading and transport efficiency
- Anomalous Diffusion of Self-Propelled Particles in Directed Random Environments
- Persistent-random-walk approach to anomalous transport of self-propelled particles
- Optimality of spatially inhomogeneous search strategies
- Trapping in and escape from branched structures of neuronal dendrites
- Mean cover time of one-dimensional persistent random walks
- Unraveling the structure of treelike networks from first-passage times of lazy random walkers
Cited by in corpus (5)
- Distinct Speed and Direction Memories of Migrating Dendritic Cells Diversify Their Search Strategies
- Orientational Memory of Active Particles in Multistate Non-Markovian Processes
- Kinematics of Persistent Random Walkers with Two Distinct Modes of Motion
- Noise-induced network topologies
- Coherent Turning Behaviors Revealed Across Adherent Cells