Lévy flights in random searches

We review the general search problem of how to find randomly located objects that can only be detected in the limited vicinity of a forager, and discuss its quantitative description using the theory of random walks. We illustrate Lévy flight foraging by comparison to Brownian random walks and discuss experimental observations of Lévy flights in biological foraging. We review recent findings suggesting that an inverse square probability density distribution P(ℓ)∼ℓ−2 of step lengths ℓ can lead to optimal searches. Finally, we survey the explanations put forth to account for these unexpected findings