article · 22/02/2012
Optimizing Persistent Random Searches
Résumé
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.
Citer cet article
Tejedor, V., Voituriez, R., & Benichou, O. (2012). Optimizing Persistent Random Searches. PHYSICAL REVIEW LETTERS, 108(8). https://doi.org/10.1103/PhysRevLett.108.088103@article{Tejedor2012_251,
author = {Tejedor, Vincent and Voituriez, Raphael and Benichou, Olivier},
year = {2012},
month = {2},
title = {Optimizing Persistent Random Searches},
journal = {PHYSICAL REVIEW LETTERS},
volume = {108},
number = {8},
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.},
url = {http://www.dx.doi.org/10.1103/PhysRevLett.108.088103},
doi = {10.1103/PhysRevLett.108.088103},
issn = {0031-9007},
}TY - JOUR
AU - Tejedor, Vincent
AU - Voituriez, Raphael
AU - Benichou, Olivier
PY - 2012
DA - 2012/02/22
TI - Optimizing Persistent Random Searches
JO - PHYSICAL REVIEW LETTERS
VL - 108
IS - 8
SN - 0031-9007
AB - 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.
DO - 10.1103/PhysRevLett.108.088103
UR - http://www.dx.doi.org/10.1103/PhysRevLett.108.088103
ER -