Services on Demand
- Cited by SciELO
- Access statistics
Print version ISSN 0103-9733
Braz. J. Phys. vol.31 no.1 São Paulo Mar. 2001
Statistical physics of random searches
G. M. Viswanathan1,2, V. Afanasyev3, Sergey V. Buldyrev2, Shlomo Havlin2,4,
M. G. E. da Luz5, E. P. Raposo6,7, and H. Eugene Stanley2
1Departamento de Física, Universidade Federal de Alagoas,
57072-970, Maceió-AL, Brazil
2Center for Polymer Studies and Department of Physics,
Boston University, Boston, MA 02215, USA
3British Antarctic Survey, Natural Environment Research Council,
High Cross, Madingley Road, CB3 0ET, Cambridge, UK
4Gonda-Goldschmied Center and Department of Physics,
Bar Ilan University, Ramat Gan, Israel
5Departamento de Física, Universidade Federal do Paraná,
81531-970, Curitiba-PR, Brazil
6Laboratório de Física Teórica e Computacional,
Departamento de Física, Universidade Federal de Pernambuco,
50670-901, Recife-PE, Brazil
7Lyman Laboratory of Physics, Harvard University,
Cambridge, MA 02138
Received 29 August, 2000
We apply the theory of random walks to quantitatively describe the general problem of how to search efficiently for randomly located objects that can only be detected in the limited vicinity of a searcher who typically has a finite degree of "free will" to move and search at will. We illustrate Lévy flight search processes by comparison to Brownian random walks and discuss experimental observations of Lévy ights in the special case of biological organisms that search for food sites. We review recent findings indicating 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 surprising findings.
What is the most efficient strategy for searching randomly located objects whose exact locations are not known a priori? This question has been recently studied by physicists [1, 2]. The general problem of how to search efficiently is a challenging one, because on the one hand the searchers typically have a certain degree of "free will" to move and search according to their choice. On the other hand, they are subject to certain physical and biological constraints which restrict their behavior.
A classic example of efficient search strategies relates to animal foraging. On the one hand, the animal's brain is sufficiently complex to allow a broad range of behavioral choices and "freedom," but on the other hand the animal must adapt and restrict its behavior to increase the chances of survival, e.g., if an animal does not eat food for a certain maximum time then it will die.
The richness of the problem stems partially because of the "ignorance" of the locations of the randomly located "target sites." However, even if the positions of all target sites were completely known in advance by a "demon" as resourceful as Laplace's , the problem of what sequential order to visit the sites in order to reduce the energy costs of locomotion is itself rather challenging: the famous "travelling salesman" optimization problem . The ignorance of the target site locations, however, introduces yet another level of difficulty and renders the problem unsuited to deterministic search algorithms that do not use some element of randomness. Indeed, only a statistical approach to the search problem can deal adequately with the element of ignorance. Such a statistical approach is analogous to how only the conceptual framework of a statistical mechanical entropy can adequately model the ignorance involved in the relationship between a single macroscopic ("thermodynamic") state and the very large number of corresponding microstates of a system in thermodynamic equilibrium . Similarly, it has been argued that statistical physics is ideally suited to the study of complex phenomena of this nature . Indeed, the general problem of how to search efficiently for randomly-located target sites can be quantitatively described [1, 2, 6] using ideas developed in the study of random walks [7, 8, 9].
Quantifying the statistical properties of search patterns is of practical relevance not only in physics but also in theoretical ecology, industry, and conceivably even to problems such as the search for missing children. Very recently, such concepts have even found application in information technology (e.g., information foraging theory  ).
II Random walks and random searches
When a searcher wanders in search of the target sites, the resulting motion can be described quantitatively as a list of the visited sites, in sequential (temporal) order. Such motion is typically random. Specifically, the motion has some degree of stochastic noise, just like a random walk created by a hypothetical "drunk" who takes steps forwards and backwards randomly with equal probability.
Brownian motion can be thought of as a kind of random walk, but the particle can move on a continuous scale. The name "Brownian" refers to Robert Brown who, in 1827, observed the irregular motion of pollen grains suspended in water . Brownian motion was not satisfactorily explained until 1905 when Albert Einstein published his classic paper . Although Brownian random walks were the first to be studied, there also exist non-Brownian random-walks.
Specifically, random walks can be classified either as Brownian (B) random walks or Lévy (L) walks:
(B) The step lengths j have a characteristic scale, usually defined by the first or second moment (mean and variance respectively) of the step length density distribution P(). An essential feature of such random walks is that their square displacement increases linearly with the number of steps taken.
(L) The step lengths have no characteristic scale, by which we mean that the moments diverge and the distribution has self-affine properties: P(l) ~ l-mP(). The square displacement of Lévy random walks, also called Lévy flights, can grow quadratically with the number of steps, so their behavior is dominated by extremely long but rare step lengths.
The majority of studied probability distributions lead to Brownian motion as a consequence of the Central Limit Theorem (CLT). If the steps are (i) large in number ( 102) and (ii) independent, i.e., free of correlations, then any probability distribution with finite moments will lead to Brownian motion. Lévy distributions have diverging lower moments, therefore the CLT is not applicable and superdiffusive behavior is possible. Moreover, Lévy walks result in a set of visited sites that form a fractal.
It is often possible to estimate experimentally the probability density distribution P() of the step or flight lengths taken by a searcher. Until recently it has often been assumed [7, 8, 9] that such a histogram of flight lengths P(j) has a well defined second moment. Hence arise Gaussian, Poisson and other classical distributions that lead to Brownian behavior. Indeed, it has generally been assumed a priori that searchers perform movements in their environments that correspond to normal diffusion.
Recently, however, it has been questioned if this assumption is unnecessarily restrictive, and whether its predictions can be supported by existing experimental data [1, 2, 13, 14, 15]. To address this question, one can assume the more general Lévy distribution [8, 9, 21],
with 1 < m £ 3 where, in fact, Gaussian behavior is a special case for m ³ 3 . Values m £ 1 do not correspond to normalizable probability distributions. Apart from its intrinsic mathematic merit, as being the largest class of stable distributions, Lévy distributions have in the last decade found useful applications in biology [8, 9], and studies of biological search processes specifically [2, 13, 14, 15]. (Note that P. Lévy originally had studied Lévy statistics since 1937, see ref. .) Whereas Brownian motion corresponds to normal diffusion, Lévy flights, in contrast, correspond to anomalous super-diffusive motion [8, 9, 17] (Fig. 1). Lévy flights have also been found to be associated with enhanced diffusion in chaotic systems (see, for instance, ).
|Figure 1. 2-D random walks for m = 2.5, 2.0, and 1.5 respectively with identical total lengths of 103 units. Micro-organisms, mammals, birds, and insects show episodes of approximately straight locomotion randomly interrupted by re-orientation events.|
Search processes can be found in biological phenomena . Extensive experimental data exist for the special case of animal search processes, in which an animal optimizes its search for, say, food [2, 13, 14, 15]. Evolution has through natural selection led over time to highly efficient-even optimal-biological search strategies. According to optimal foraging theory, animals seek to maximize the returns (in calories, nutrients etc.) on their labor in deciding how best to forage . Since physical as well as neurophysiological and evolutionary factors come into play, searching is a rich problem that continues to present multi-faceted and interdisciplinary challenges.
Microorganisms, insects, birds, and mammals have been found to follow a Lévy distribution of flight lengths or times (assumed to be proportional or at least correlated statistically) [1, 2, 13, 14, 15] (Fig. 2). Moreover, the exponent m appears to be the same in many instances . When the nectar concentration is normal (low), the flight length distribution of bumble bees [1, 22] decays like Eq. (1) with m » 2 (Fig. 2(a)). Similarly, the value m » 2 is also found for the searching time distribution of the Wandering Albatross  (Fig. 2(b)) and deer (Fig. 2(c)) in both wild and fenced areas [1, 23]. Even the value 2 £ m £ 2.5 found for amoebas  supports the hypothesis that mopt = 2 might be a universal value of the exponent in Lévy flight searches. What, might we ask, drives animals to this type of behavior and what benefits, if any, do they thus derive from Lévy flight motion?
|Figure 2. (a) Double log plot of the flight length percentage distributions for searching bumble bees, digitized from ref.. Note the value m » 2 for normal (low) nectar concentration. The value m » 3.5 for (» 10×) higher nectar concentrations in which long flights become very rare (see text) is also consistent with the theory. (b) double log plot of the histograms of flight times (in 1 h intervals) for the Wandering Albatross . (c) Double log plot of the searching time (secs) percentage distributions for deer in wild areas and fenced areas.|
III Lévy flight search patterns
Why flight lengths might follow a Lévy distribution rather than a Gaussian or Poisson distribution is of general interest. The reasons behind the experimentally observed Lévy flights in biological searches have never been fully understood, but a number of studies have shed some light. Levandowsky et al.[13, 14] have suggested reasons why microorganisms may perform Lévy flights in three dimensions (3-D), showing that a Lévy distribution is advantageous since the probability of returning to a previously-visited site is smaller than for a Gaussian distribution, irrespective of the value of m chosen . A related explanation proposed by M. F. Shlesinger (see ) argues that foragers may perform Lévy flights because the number of new visited sites is much larger for n Lévy walkers than for n Brownian walkers . The n Lévy walkers diffuse so rapidly that the competition for the resources (target sites) among themselves is greatly reduced relative to the competition encountered by the n Brownian walkers, who typically remain close to the origin, hence to each other. A Lévy flight strategy is also a good solution for the related problem where N radar stations search for M targets . Yet another proposed hypothesis is that the fractal properties of the set of sites visited by a Lévy walker are related to scale invariant properties of the underlying ecosystem . Specifically, a fractal distribution of target sites may explain the observed Lévy flights . Very recently, there has been a study of how the search efficiency depends on the value m of the Lévy exponent . This study finds that there is an optimum value mopt= 2 which can lead to optimal searches when the target sites are randomly and sparsely distributed. Below, we discuss this latest development in greater detail.
By studying how the search efficiency varies with m, one can compare different classes of search strategies characterized by unique values of m. In the first case of "non-destructive search", the forager can visit the same target site many times. Nondestructive search is more realistic (see below) and can occur in either of two cases: (i) if the target sites become temporarily depleted, or (ii) if the forager becomes satiated and leaves the area. In the second case of "destructive search", the target site found by the forager becomes undetectable in subsequent flights. Consider the following idealized model that captures some of the essential dynamics of searches in the limiting case in which predator-prey relationships are ignored, and learning is minimized. Assume that target sites are distributed randomly, and the forager behaves as follows (see Fig. 3):
(1) If there is a target site located within a "direct vision" distance rv, then the forager moves on a straight line to the nearest target site.
(2) If there is no target site within a distance rv, then the forager chooses a direction at random and a distance j from the probability distribution, Eq. (1). It then incrementally moves to the new point, constantly looking for a target within a radius rv along its way. If it does not detect a target, it stops after traversing the distance j and chooses a new direction and a new distance j+1, otherwise it proceeds to the target as in step (1).
|Figure 3. Search strategy: (a) If there is a target site (full square) located within a "direct vision" distance rv, then the forager moves on a straight line to it. (b) If there is no target site within a distance rv, then the forager chooses a random direction and a random distance j from the Lévy probability distribution P(j) ~ j-m, and then proceeds as explained in the text.|
One can solve this model as follows: let l be the mean free path of the forager between successive target sites (for 2-D, l º (2rvr)-1 where r is the target site area density). The mean flight distance is
The second term of this "mean field" calculation is an approximation because it assumes that the distances between successive sites are identically equal to l, so that there are no flights longer than l. A new target site is always encountered a maximum distance l away from the previous target site, effectively resulting in a truncated Lévy distribution . A more rigorous treatment that considers not only the mean value but also a Poisson distribution of the free paths does not seem to alter the results significantly, as further discussed below.
One defines the search efficiency function h(m) to be the ratio of the number of target sites visited to the total distance traversed by the forager. Since the total distance travelled is approximately equal to the product of the total number of flights and the mean flight lengtháñ, therefore
where N is the mean number of flights taken by a Lévy forager in order to travel between two successive target sites.
Consider first the case of destructive search, when the target site is "eaten" or destroyed by the searching animal and becomes unavailable in subsequent flights. The mean number of flights Nd taken to travel an average distance l between two successive target sites scales as
for 1 < m £ 3. Here m-1 is the fractal dimension of the set of sites visited by a Lévy random walker . Note that Nd ~ (l/rv)2 for m > 3 (Brownian case). Consider the common case in which the target sites are "sparsely" distributed, defined by l rv. Substituting Eqs. (2) and (4) into (3) one finds that the mean efficiency h has no maximum, with lower values of m leading to more efficient searches. Note that when m = 1 + with ® 0+, the fraction of flights with j < l becomes negligible, and effectively the forager moves along straight lines until it detects a target site.
Consider next the case of nondestructive search for sparsely distributed target sites. Since previously-visited sites can then be revisited, the mean number Nd of flights between successive target sites in Eq. (4) overestimates the true number Nn for the nondestructive case. It can be shown that Nn ~ Nd1/2 holds generally, so it follows that
for 1 < m £ 3. Notice that Nn ~ l/rv for m > 3 (Brownian case). Indeed, we have recently proved that Eq. 5 is in fact a rigorous result . This result has also been systematically tested using simulations and found to become better and better as (l/rv) increases (compare also Figs. 4(a) and (b)). Note that if l rv then Nd Nn. Substituting Eqs. (2) and (5) into (3) and differentiating with respect to m, one finds that the optimal efficiency h = 1/(Nnáñ) is achieved at
where d ~ 1/[ln(l/rv)]2 . So in the absence of a priori knowledge about the distribution of target sites, an optimal strategy for a forager is to choose mopt=2 when l/rv is large but not exactly known.
|Figure 4. The product of the search efficiency h and the mean free path l vs. m in 1-D for different l, found (a) from Eqs. (2) and (3) (rv = 1) for the case of nondestructive search and (b) from simulations. (c) hl found from simulations in 2-D, with l = 5000 (rv = 1). In each case, mopt » 2 emerges as an optimal value of the Lévy flight exponent. Inset: the food is distributed in patches of food-rich areas in an otherwise empty environment, obtained by computing mm = -dlogN()/dlog from the histograms N() of flight lengths. Only flights with log10 < 4.5 are considered in order to eliminate the effects of the periodic boundaries. Again, mm » 2 seems to optimize the search efficiency.|
The above results are independent of the dimension of the search space. This is analogous to the behavior of Brownian random walks whose mean square displacement is proportional to the number of steps in any dimension . Furthermore, Eqs. (4) and (5) describe the correct scaling properties even in the presence of short-range correlations in the directions and lengths of the flights. Short-range correlations can alter the width of the distribution P(), but cannot change m, so these findings remain unchanged. Hence, learning, predator-prey relationships, and other short-term memory effects become unimportant in the long-time long-distance limit.
Note also that for both destructive and nondestructive searches, Brownian behavior, corresponding to m ³ 3, is significantly less efficient than Lévy flight motion. This finding suggests that a power law distribution of flight lengths may be essential for optimal searches when the target sites are sparsely and randomly distributed. (One may argue that animals would possibly starve to death while adopting a Gaussian strategy of foraging.)
For completeness, consider also the case in which the target sites are plentiful, i.e., l £ rv. Then áñ » l and Nd » Nn » 1. Hence, h becomes independent of m. This behavior does not correspond to Lévy flight searches but is more similar to a Brownian random walk. The independence of h on m is a direct consequence of the extreme rarity of long flights with j > rv.
These theoretical results have been supported with numerical simulations which do not depend on approximations. Indeed, 1-D and 2-D simulations have been performed of the above model to study how h varies with m for the case of nondestructive searches. For the case of nondestructive searches, Fig. 4(a) shows the simulation results for various values of l and rv=1. For 1-D, the position of the maximum in h for the simulation agrees with the analytical results (Fig. 4(b)), and approaches mopt=2 as l® ¥. The simulation results for 2-D nondestructive search also show maxima near mopt=2. Fig. 4(c) shows simulated search in a system of size 104 × 104 with rv=1, periodic boundary conditions, and l/rv=5 × 103. Moreover, for destructive search with l rv, simulations show that m® 1 optimizes the efficiency as predicted. In contrast, if the target sites are densely distributed such that l » rv, then, as expected, we find no significant effect of varying m. These findings agree with the theoretical predictions and raise the possibility that Lévy flight searches with m < 3 may be confined to instances of low global target site concentration, since the principal advantage of choosing small m - long flights - becomes negligible when there are ample target sites. Indeed, bees appear not to apply Lévy flight foraging for artifically high nectar concentrations (see also Figs. 2(a) and 2(b)).
We also note that nondestructive search is more realistic than destructive search because in nature, flowers, berries, krill, fish, etc. are usually found in patches or clumps which are rarely completely depleted. Thus an animal can revisit the same food patch many times, and a patch can restore itself by regrowth. Simulations of destructive searches in patchy target site distributions give results consistent with nondestructive searches for uniformly distributed target sites. As an illustrative example, Fig. 4c (inset) shows h(m) found from simulating a patchy distribution of food. There are many small randomly distributed food-rich regions, each with radius R, outside of which there is no food to be found. To speed up the simulations, it was assumed that the forager performs a Lévy Flight only outside the region of radius R, and that it instead performs Brownian motion within, finding food at each site along the way separated by the local mean free path l = R/3. The system size used was 105 × 105. A low patch area to system area ratio of p × 10-6 is achieved using a patch radius of R=10, and 104 patches. Here, mm º -dlogN()/dlog was measured from the histogram N() of flight lengths instead of using the parameter m from the model. Such a histogram represents an experimentally observable distribution of flight lengths. Note that mm is consistent with the theoretically predicted value mopt.
We thank CNPq, NIH, and NSF for financial support.
 G. M. Viswanathan, S. Buldyrev, S. Havlin, M. G. E. da Luz, E. P. Raposo and H. E. Stanley, Nature 401, 911 (1999). [ Links ]
 G. M. Viswanathan, V. Afanasyev, S. V. Buldyrev, E. J. Murphy, P. A. Prince and H. E. Stanley, Nature 381, 413 (1996). [ Links ]
 P.S. Laplace, A Philosophical Essay on Probabilities, Transl. by F. W. Truscott and F. L. Emory (Dover Publications, New York, 1951); Essai philosophique sur les probabilités, rééd. C. Bourgeois, Paris, 1986 (texte de la 5ème éd., 1825). [ Links ]
 J.B. Kruskal, Proc. American Math. Society 7, 48 (1956). [ Links ]
 G. M. Viswanathan, S. Buldyrev, S. Havlin, M. G. E. da Luz, E. P. Raposo and H. E. Stanley, Physica A 282, 1 (2000). [ Links ]
 C. Tsallis, Physics World 10, 42 (1997). [ Links ]
 M. F. Shlesinger, G. M. Zaslavsky and J. Klafter, Nature 363, 31 (1993); [ Links ]M. F. Shlesinger, G. Zaslavsky and U. Frisch, eds. Lévy Flights and Related Topics in Physics (Springer, Berlin, 1995). [ Links ]
 P. Pirolli and S. Card, in Proc. 1995 Conf. on Human Factors in Computing Systems (ACM Press, New York, 1995) p. 51. [ Links ]
 R. Brown, A Brief Account of Microscopical Observations, etc., London (not published) 1827. [ Links ]
 A. Einstein, Investigations on the theory of the Brownian movement, Ed. R. Fürth, Tr. A. D. Cowper (Dover, London, 1926). [ Links ]
 M. Levandowsky, J. Klafter and B. S. White, Bull. Marine Sci. 43, 758 (1988). [ Links ]
 F. L. Schuster and M. Levandowsky, J. Euk. Microbiol. 43, 150 (1996). [ Links ]
 B. J. Cole, Anim. Behav. 50, 1317 (1995). [ Links ]
 S. V. Buldyrev, A. L. Goldberger, S. Havlin, C.-K. Peng, M. Simons and H. E. Stanley, Phys. Rev. E 47, 4514 (1993). [ Links ]
 Sergey V. Buldyrev et. al, preprint, June 2000. [ Links ]
 G. Zumofen, J. Klafer and A. Blumen, Phys. Rev. E 47, 2183 (1993). [ Links ]
 David W. Stephens and John R. Krebs, Foraging Behavior (Princeton University Press, Princeton, 1987); [ Links ]Alan C. Kamil, John R. Drebs and H. Ronald Pulliam, Eds., Foraging Behavior (Plenum Pub. Corp., New York, 1987). [ Links ]
 P. Nonacs and L. M. Lill, Oikos 67, 371 (1993). [ Links ]
 B. Heinrich, Oecologia 40, 235 (1979). [ Links ]
 S. Focardi, P. Marcellini and P. Montanaro, J. Anim. Ecol. 65, 606 (1996). [ Links ]
 M. F. Shlesinger and J. Klafter, in: On Growth and Form, edited by H. E. Stanley and N. Ostrowsky (Nijhoff, Dordrecht, 1986), p. 279. [ Links ]
 G. Berkolaiko, S. Havlin, H. Larralde and G. H. Weiss, Phys. Rev. E 53, 5774 (1996); [ Links ]Phys. Rev. E 55, 1395 (1997). [ Links ]H. Larralde, P. Trunfio, S. Havlin, H. E. Stanley and G. H. Weiss, Nature 355, 423 (1992). [ Links ]
 H. Szu, Algorithms. in Dynamic Patterns in Complex Systems, ed. J. A. S. Kelso, A. J. Mandell and M. F. Shlesinger (World Scientific, Singapore, 1988), p.121. [ Links ]
 R. N. Mantegna and H. E. Stanley, Phys Rev. Lett. 73, 2946 (1994). [ Links ]
 M. F. Shlesinger and J. Klafter, Phys. Rev. Lett. 54, 2551 (1985). [ Links ]