Optimizing persistent random searches

Details Optimizing persistent random searches Optimizing persistent random searches

2011-11-08

arxiv.org/abs/1111.1881v2

Phys. Rev. Lett. 108 (2012) 088103

Physics

Condensed Matter

Statistical Mechanics

4 pages, 4 figures

Scientific paper

10.1103/PhysRevLett.108.088103

We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial 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 with 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.

Affiliated with

Also associated with

No associations

Rating

Optimizing persistent random searches does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimizing persistent random searches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing persistent random searches will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53567