相关论文: Inverse square L\'evy walks are not optimal search…
It is widely accepted that inverse square L\'evy walks are optimal search strategies because they maximize the encounter rate with sparse, randomly distributed, replenishable targets when the search restarts in the vicinity of the…
L\'evy walks are random walk processes whose step-lengths follow a long-tailed power-law distribution. Due to their abundance as movement patterns of biological organisms, significant theoretical efforts have been devoted to identifying the…
We refute here the concernes raised in the Comment of our letter. This reply states clearly the validity range of our results and shows that the optimality of inverse-square Levy walks at the basis of the Levy flight foraging hypothesis is…
The L\'evy flight foraging hypothesis states that organisms must have evolved adaptations to exploit L\'evy walk search strategies. Indeed, it is widely accepted that inverse square L\'evy walks optimize the search efficiency in foraging…
Target shape, not just size, plays a pivotal role in determining detectability during random search. We analyze intermittent L\'evy walks in three dimensions, and mathematically prove that the widely observed Cauchy strategy (L\'evy…
An efficient searcher needs to balance properly the tradeoff between the exploration of new spatial areas and the exploitation of nearby resources, an idea which is at the core of scale-free L\'evy search strategies. Here we study…
The Levy walk in which the frequency of occurrence of step lengths follows a power-law distribution, can be observed in the migratory behavior of organisms at various levels. Levy walks with power exponents close to 2 are observed, and the…
Motivated by the L\'evy foraging hypothesis -- the premise that various animal species have adapted to follow L\'evy walks to optimize their search efficiency -- we study the parallel hitting time of L\'evy walks on the infinite…
Search strategies based on random walk processes with long-tailed jump length distributions (Levy walks) on the one hand and intermittent behavior switching between local search and ballistic relocation phases on the other, have been…
We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest…
Animals foraging alone are hypothesized to optimize the encounter rates with resources through L\'evy walks. However, the issue of how the interactions between multiple foragers influence their search efficiency is still not completely…
The L\'evy walk, a type of random walk characterized by linear step lengths that follow a power-law distribution, is observed in the migratory behaviors of various organisms, ranging from bacteria to humans. Notably, L\'evy walks with power…
Levy flights are known to be optimal search strategies in the particular case of revisitable targets. In the relevant situation of non revisitable targets, we propose an alternative model of bidimensional search processes, which explicitly…
In natural foraging, many organisms seem to perform two different types of motile search: directed search (taxis) and random search. The former is observed when the environment provides cues to guide motion towards a target. The latter…
Autonomous robots are commonly tasked with the problem of area exploration and search for certain targets or artifacts of interest to be tracked. Traditionally, the problem formulation considered is that of complete search and thus -…
L\'{e}vy flights is a random walk where the step-lengths have a probability distribution that is heavy-tailed. It has been shown that L\'{e}vy flights can maximize the efficiency of resource searching in uncertain environments, and also…
L\'evy walks are continuous time random walks with spatio-temporal coupling of jump lengths and waiting times, often used to model superdiffusive spreading processes such as animals searching for food, tracer motion in weakly chaotic…
In many random search processes of interest in chemistry, biology or during rescue operations, an entity must find a specific target site before the latter becomes inactive, no longer available for reaction or lost. We present exact results…
We consider a stationary prey in a given region of space and we aim at detecting optimal foraging strategies. On the one hand, when the prey is uniformly distributed, the best possible strategy for the forager is to be stationary and…
We study the efficiency of random search processes based on L{\'e}vy flights with power-law distributed jump lengths in the presence of an external drift, for instance, an underwater current, an airflow, or simply the bias of the searcher…