Optimizing persistent random searches.
TL;DR: The results show that the distribution of targets plays a crucial role in the random search problem, and it is found that persistent random walks with exponential distribution of excursion lengths can minimize the search time, and in that sense perform better than any Levy walk.
read more
Abstract: We consider a minimal model of persistent random searcher with a short range memory. We calculate exactly for such a searcher the mean first-passage time to a target in a bounded domain and find that it admits a nontrivial 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 to 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
L\'evy walks
TL;DR: The Levy walk model combines two key features, the ability to generate anomalously fast diffusion and a finite velocity of a random walker, and has been widely used in many fields.
749
Random walks and diffusion on networks
TL;DR: The theory and applications of random walks on networks are surveyed, restricting ourselves to simple cases of single and non-adaptive random walkers, and three main types are distinguished: discrete-time random walks, node-centric continuous-timerandom walks, and edge-centric Continuous-Time random walks.
642
Actin Flows Mediate a Universal Coupling between Cell Speed and Cell Persistence
Paolo Maiuri,Jean-François Rupprecht,Stefan Wieser,Verena Ruprecht,Olivier Bénichou,Nicolas Carpi,Mathieu Coppey,Simon de Beco,Nir S. Gov,Carl-Philipp Heisenberg,Carolina Lage Crespo,Franziska Lautenschlaeger,Maël Le Berre,Ana-Maria Lennon-Duménil,Matthew Raab,Hawa Racine Thiam,Matthieu Piel,Michael Sixt,Raphaël Voituriez +18 more
TL;DR: It is shown on the basis of experimental data in vitro and in vivo that cell persistence, which quantifies the straightness of trajectories, is robustly coupled to cell migration speed, and suggested that this universal coupling constitutes a generic law of cell migration.
460
Random walks and diffusion on networks
TL;DR: Random walks have been studied for many decades on both regular lattices and (especially in the last couple of decades) on networks with a variety of structures as discussed by the authors, and they are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including diffusion, interactions, and opinions among humans and animals; and can extract information about important entities or dense groups of entities in networks.
375
From first-passage times of random walks in confinement to geometry-controlled kinetics
TL;DR: In this article, the authors present a general theory which allows one to accurately evaluate the mean first-passage time (FPT) for regular random walks in bounded domains, and its extensions to related firstpassage observables such as splitting probabilities and occupation times.
304
References
A Guide to First-Passage Processes by Sidney Redner
Sidney Redner
- 01 Aug 2001
Abstract: Preface Errata 1. First-passage fundamentals 2. First passage in an interval 3. Semi-infinite system 4. Illustrations of first passage in simple geometries 5. Fractal and nonfractal networks 6. Systems with spherical symmetry 7. Wedge domains 8. Applications to simple reactions References Index.
2.7K
Optimizing the success of random searches
Gandhimohan. M. Viswanathan,Gandhimohan. M. Viswanathan,Gandhimohan. M. Viswanathan,Sergey V. Buldyrev,Shlomo Havlin,Shlomo Havlin,M. G. E. da Luz,M. G. E. da Luz,E. P. Raposo,E. P. Raposo,H. Eugene Stanley +10 more
TL;DR: It is shown that, when the target sites are sparse and can be visited any number of times, an inverse square power-law distribution of flight lengths, corresponding to Lévy flight motion, is an optimal strategy.
1.6K
Lévy flight search patterns of wandering albatrosses
Gandhimohan. M. Viswanathan,Vsevolod Afanasyev,Sergey V. Buldyrev,Eugene J. Murphy,P. A. Prince,H. E. Stanley +5 more
TL;DR: In this article, the authors study the foraging behavior of the wandering albatross Diomedea exulans and find a power-law distribution of flight-time intervals.
1.4K
Revisiting Lévy flight search patterns of wandering albatrosses, bumblebees and deer.
Andrew M. Edwards,Andrew M. Edwards,Richard A. Phillips,Nicholas W. Watkins,Mervyn P. Freeman,Eugene J. Murphy,Vsevolod Afanasyev,Sergey V. Buldyrev,Sergey V. Buldyrev,M. G. E. da Luz,Ernesto P. Raposo,H. Eugene Stanley,Gandhimohan. M. Viswanathan +12 more
TL;DR: This work analyzes a new, high-resolution data set of wandering albatross flights, and finds no evidence for Lévy flight behaviour, and proposes a widely applicable method to test for power-law distributions using likelihood and Akaike weights.
Intermittent search strategies
TL;DR: This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected, which suggest that the intrinsic efficiency of intermittent search strategies could justify their frequent observation in nature.