Optimizing the success of random searches

G. M. Viswanathan, Sergey V. Buldyrev, Shlomo Havlin, M. G.E. Da Luz, E. P. Raposo, H. Eugene Stanley

Research output: Contribution to journalArticlepeer-review

1145 Scopus citations


We address the general question of what is the best statistical strategy to adapt in order to search efficiently for randomly located objects ('target sites'). It is often assumed in foraging theory that the flight lengths of a forager have a characteristic scale: from this assumption gaussian, Rayleigh and other classical distributions with well-defined variances have arisen. However, such theories cannot explain the long-tailed power-law distributions of flight lengths or flight times that are observed experimentally. Here we study how the search efficiency depends on the probability distribution of flight lengths taken by a forager that can detect target sites only in its limited vicinity. We show 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 Levy flight motion, is an optimal strategy. We test the theory by analyzing experimental foraging data on selected insect, mammal and bird species, and find that they are consistent with the predicted inverse square power-law distributions.

Original languageEnglish
Pages (from-to)911-914
Number of pages4
Issue number6756
StatePublished - 28 Oct 1999


Dive into the research topics of 'Optimizing the success of random searches'. Together they form a unique fingerprint.

Cite this