Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSearch reliability and search efficiency of combined Levy-Brownian motion: long relocations mingled with thorough local exploration
128
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A combined dynamics consisting of Brownian motion and Levy 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 doing so economically of such dynamics thus poses an important problem. Here we model this dynamics by a one-dimensional fractional Fokker-Planck equation combining unbiased Brownian motion and Levy flights. By solving this equation both analytically and numerically we show that the superposition of recurrent Brownian motion and Levy flights with stable exponent $alpha<1$, by itself implying zero probability of hitting a point on a line, lead to transient motion with finite probability of hitting any point on the line. We present results for the exact dependence of the values of both the search reliability and the search efficiency on the distance between the starting and target positions as well as the choice of the scaling exponent $alpha$ of the Levy flight component.
rate research
Read More
Efficiency of search for randomly distributed targets is a prominent problem in many branches of the sciences. For the stochastic process of Levy walks, a specific range of optimal efficiencies was suggested under variation of search intrinsic and extrinsic environmental parameters. In this article, we study fractional Brownian motion as a search process, which under parameter variation generates all three basic types of diffusion, from sub- to normal to superdiffusion. In contrast to Levy walks, fractional Brownian motion defines a Gaussian stochastic process with power law memory yielding anti-persistent, respectively persistent motion. Computer simulations of search by time-discrete fractional Brownian motion in a uniformly random distribution of targets show that maximising search efficiencies sensitively depends on the definition of efficiency, the variation of both intrinsic and extrinsic parameters, the perception of targets, the type of targets, whether to detect only one or many of them, and the choice of boundary conditions. In our simulations we find that different search scenarios favour different modes of motion for optimising search success, defying a universality across all search situations. Some of our numerical results are explained by a simple analytical model. Having demonstrated that search by fractional Brownian motion is a truly complex process, we propose an over-arching conceptual framework based on classifying different search scenarios. This approach incorporates search optimisation by Levy walks as a special case.
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 flights process. The convergence to the ground state is fast due to a polynomial decrease rate of the temperature.
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where a random walker intermittently revisits previously visited sites according to a reinforced rule. The emergence of frequently visited locations generates very slow diffusion, logarithmic in time, whereas the walker probability density tends to a Gaussian. This scaling form does not emerge from the Central Limit Theorem but from an unusual balance between random and long-range memory steps. In single trajectories, occupation patterns are heterogeneous and have a scale-free structure. The model exhibits good agreement with data of free-ranging capuchin monkeys.
68 -
R. Klages (Max Planck Institute for the Physics of Complex Systems
, n Dresden
, School of Mathematical Sciences
2018
This book chapter introduces to the problem to which extent search strategies of foraging biological organisms can be identified by statistical data analysis and mathematical modeling. A famous paradigm in this field is the Levy Flight Hypothesis: It states that under certain mathematical conditions Levy flights, which are a key concept in the theory of anomalous stochastic processes, provide an optimal search strategy. This hypothesis may be understood biologically as the claim that Levy flights represent an evolutionary adaptive optimal search strategy for foraging organisms. Another interpretation, however, is that Levy flights emerge from the interaction between a forager and a given (scale-free) distribution of food sources. These hypotheses are discussed controversially in the current literature. We give examples and counterexamples of experimental data and their analyses supporting and challenging them.
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 Levy search based on long-tailed jump length distributions. We then compare these results with a search process combined of two different long-tailed jump length distributions. Moreover, we study the case of multiple targets located by a Levy searcher.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
