{"paper":{"title":"Optimal L\\'{e}vy-flight foraging in a finite landscape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.bio-ph","q-bio.PE"],"primary_cat":"cond-mat.stat-mech","authors_text":"Adam McKeown, Branislav Kusy, David Westcott, Hazel Parry, Jiajun Liu, Kun Zhao, Philipp Sommer, Raja Jurdak","submitted_at":"2014-06-06T11:31:34Z","abstract_excerpt":"We present a simple model to study L\\'{e}vy-flight foraging in a finite landscape with countable targets. In our approach, foraging is a step-based exploratory random search process with a power-law step-size distribution $P(l) \\propto l^{-\\mu}$. We find that, when the termination is regulated by a finite number of steps $N$, the optimum value of $\\mu$ that maximises the foraging efficiency can vary substantially in the interval $\\mu \\in (1,3)$, depending on the landscape features (landscape size and number of targets). We further demonstrate that subjective returning can be another significan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1649","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}