Refine
Has Fulltext
- no (2) (remove)
Year of publication
- 2022 (2) (remove)
Document Type
- Article (2)
Language
- English (2)
Is part of the Bibliography
- yes (2) (remove)
Keywords
- anomalous (1)
- asymmetric Levy flights (1)
- decomposing anomalous diffusion (1)
- diffusion exponent (1)
- first-arrival density (1)
- process inference (1)
- search efficiency (1)
- time-series analysis (1)
Institute
We study the first-arrival (first-hitting) dynamics and efficiency of a one-dimensional random search model performing asymmetric Levy flights by leveraging the Fokker-Planck equation with a delta-sink and an asymmetric space-fractional derivative operator with stable index alpha and asymmetry (skewness) parameter beta.
We find exact analytical results for the probability density of first-arrival times and the search efficiency, and we analyse their behaviour within the limits of short and long times.
We find that when the starting point of the searcher is to the right of the target, random search by Brownian motion is more efficient than Levy flights with beta <= 0 (with a rightward bias) for short initial distances, while for beta>0 (with a leftward bias) Levy flights with alpha -> 1 are more efficient.
When increasing the initial distance of the searcher to the target, Levy flight search (except for alpha=1 with beta=0) is more efficient than the Brownian search. Moreover, the asymmetry in jumps leads to essentially higher efficiency of the Levy search compared to symmetric Levy flights at both short and long distances, and the effect is more pronounced for stable indices alpha close to unity.
Recently, a large number of research teams from around the world collaborated in the so-called 'anomalous diffusion challenge'. Its aim: to develop and compare new techniques for inferring stochastic models from given unknown time series, and estimate the anomalous diffusion exponent in data. We use various numerical methods to directly obtain this exponent using the path increments, and develop a questionnaire for model selection based on feature analysis of a set of known stochastic processes given as candidates. Here, we present the theoretical background of the automated algorithm which we put for these tasks in the diffusion challenge, as a counter to other pure data-driven approaches.