Assessing Lévy walks as models of animal foraging
Bibliographic record
Abstract
The hypothesis that the optimal search strategy is a Lévy walk (LW) or Lévy flight, originally suggested in 1995, has generated an explosion of interest and controversy. Long-standing empirical evidence supporting the LW hypothesis has been overturned, while new models and data are constantly being published. Statistical methods have been criticized and new methods put forward. In parallel with the empirical studies, theoretical search models have been developed. Some theories have been disproved while others remain. Here, we gather together the current state of the art on the role of LWs in optimal foraging theory. We examine the body of theory underpinning the subject. Then we present new results showing that deviations from the idealized one-dimensional search model greatly reduce or remove the advantage of LWs. The search strategy of an LW with exponent μ = 2 is therefore not as robust as is widely thought. We also review the available techniques, and their potential pitfalls, for analysing field data. It is becoming increasingly recognized that there is a wide range of mechanisms that can lead to the apparent observation of power-law patterns. The consequence of this is that the detection of such patterns in field data implies neither that the foragers in question are performing an LW, nor that they have evolved to do so. We conclude that LWs are neither a universal optimal search strategy, nor are they as widespread in nature as was once thought.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.000 | 0.003 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.004 | 0.003 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".