Related papers: On optimal tempered L\'evy flight foraging
Nature-inspired algorithms such as Particle Swarm Optimization and Firefly Algorithm are among the most powerful algorithms for optimization. In this paper, we intend to formulate a new metaheuristic algorithm by combining Levy flights with…
We obtain the first passage time density for a L\'{e}vy flight random process from a subordination scheme. By this method, we infer the asymptotic behavior directly from the Brownian solution and the Sparre Andersen theorem, avoiding…
L\'{e}vy flight models whose jumps have infinite moments are mathematically used to describe the superdiffusion in complex systems. Exponentially tempering the Levy measure of L\'{e}vy flights leads to the tempered stable L\'{e}vy processes…
What is the fastest way of finding a randomly hidden target? This question of general relevance is of vital importance for foraging animals. Experimental observations reveal that the search behaviour of foragers is generally intermittent:…
We study analytically an intermittent search process in one dimension. There is an immobile target at the origin and a searcher undergoes a discrete time jump process starting at $x_0\geq0$, where successive jumps are drawn independently…
This paper investigates a class of stochastic Logistic harvesting models driven by tempered stable processes, with a one-sided power-law L\'evy measure. We establish threshold conditions for population extinction and persistence, prove the…
A combined dynamics consisting of Brownian motion and L\'evy flights is exhibited by a variety of biological systems performing search processes. Assessing the search reliability of ever locating the target and the search efficiency of…
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…
We consider diffusive motion of a particle performing a random walk with L\'evy distributed jump lengths and subject to resetting mechanism bringing the walker to an initial position at uniformly distributed times. In the limit of infinite…
Most global optimization problems are nonlinear and thus difficult to solve, and they become even more challenging when uncertainties are present in objective functions and constraints. This paper provides a new two-stage hybrid search…
Transport of the Brownian particles driven by L\'evy flights coexisting with subdiffusion in asymmetric periodic potentials is investigated in the absence of any external driving forces. Using the Langevin-type dynamics with subordination…
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…
We address the generic problem of random search for a point-like target on a line. Using the measures of search reliability and efficiency to quantify the random search quality, we compare Brownian search with L\'evy search based on…
After a short excursion from discovery of Brownian motion to the Richardson "law of four thirds" in turbulent diffusion, the article introduces the L\'{e}vy flight superdiffusion as a self-similar L\'{e}vy process. The condition of…
Recent analysis of empirical data [F. Radicchi, A. Baronchelli & L.A.N. Amaral. PloS ONE 7, e029910 (2012)] showed that humans adopt L\'evy flight strategies when exploring the bid space in on-line auctions. A game theoretical model proved…
We investigate the first-passage dynamics of symmetric and asymmetric L\'evy flights in a semi-infinite and bounded intervals. By solving the space-fractional diffusion equation, we analyse the fractional-order moments of the first-passage…
We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial minimum as function…
Among Markovian processes, the hallmark of L\'evy flights is superdiffusion, or faster-than-Brownian dynamics. Here we show that L\'evy laws, as well as Gaussians, can also be the limit distributions of processes with long range memory that…
In environments with scarce resources, adopting the right search strategy can make the difference between succeeding and failing, even between life and death. At different scales, this applies to molecular encounters in the cell cytoplasm,…
We solve a problem of non-convex stochastic optimisation with help of simulated annealing of Levy flights of a variable stability index. The search of the ground state of an unknown potential is non-local due to big jumps of the Levy…