اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSlow Levy flights
338
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Among Markovian processes, the hallmark of Levy flights is superdiffusion, or faster-than-Brownian dynamics. Here we show that Levy laws, as well as Gaussians, can also be the limit distributions of processes with long range memory that exhibit very slow diffusion, logarithmic in time. These processes are path-dependent and anomalous motion emerges from frequent relocations to already visited sites. We show how the Central Limit Theorem is modified in this context, keeping the usual distinction between analytic and non-analytic characteristic functions. A fluctuation-dissipation relation is also derived. Our results may have important applications in the study of animal and human displacements.
قيم البحث
اقرأ أيضاً
Let L(t) be a Levy flights process with a stability index alphain(0,2), and U be an external multi-well potential. A jump-diffusion Z satisfying a stochastic differential equation dZ(t)=-U(Z(t-))dt+sigma(t)dL(t) describes an evolution of a Levy parti
cle of an `instant temperature sigma(t) in an external force field. The temperature is supposed to decrease polynomially fast, i.e. sigma(t)approx t^{-theta} for some theta>0. We discover two different cooling regimes. If theta<1/alpha (slow cooling), the jump diffusion Z(t) has a non-trivial limiting distribution as tto infty, which is concentrated at the potentials local minima. If theta>1/alpha (fast cooling) the Levy particle gets trapped in one of the potential wells.
Levy Flights are paradigmatic generalised random walk processes, in which the independent stationary increments---the jump lengths---are drawn from an $alpha$-stable jump length distribution with long-tailed, power-law asymptote. As a result, the var
iance of Levy Flights diverges and the trajectory is characterised by occasional extremely long jumps. Such long jumps significantly decrease the probability to revisit previous points of visitation, rendering Levy Flights efficient search processes in one and two dimensions. To further quantify their precise property as random search strategies we here study the first-passage time properties of Levy Flights in one-dimensional semi-infinite and bounded domains for symmetric and asymmetric jump length distributions. To obtain the full probability density function of first-passage times for these cases we employ two complementary methods. One approach is based on the space-fractional diffusion equation for the probability density function, from which the survival probability is obtained for different values of the stable index $alpha$ and the skewness (asymmetry) parameter $beta$. The other approach is based on the stochastic Langevin equation with $alpha$-stable driving noise. Both methods have their advantages and disadvantages for explicit calculations and numerical evaluation, and the complementary approach involving both methods will be profitable for concrete applications. We also make use of the Skorokhod theorem for processes with independent increments and demonstrate that the numerical results are in good agreement with the analytical expressions for the probability density function of the first-passage times.
We derive the generalized Fokker-Planck equation associated with a Langevin equation driven by arbitrary additive white noise. We apply our result to study the distribution of symmetric and asymmetric L{e}vy flights in an infinitely deep potential we
ll. The fractional Fokker-Planck equation for L{e}vy flights is derived and solved analytically in the steady state. It is shown that L{e}vy flights are distributed according to the beta distribution, whose probability density becomes singular at the boundaries of the well. The origin of the preferred concentration of flying objects near the boundaries in nonequilibrium systems is clarified.
We investigate the first-passage dynamics of symmetric and asymmetric Levy 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 time probabi
lity density function for different values of the index of stability and the skewness parameter. A comparison with results using the Langevin approach to Levy flights is presented. For the semi-infinite domain, in certain special cases analytic results are derived explicitly, and in bounded intervals a general analytical expression for the mean first-passage time of Levy flights with arbitrary skewness is presented. These results are complemented with extensive numerical analyses.
We consider one-dimensional discrete-time random walks (RWs) with arbitrary symmetric and continuous jump distributions $f(eta)$, including the case of Levy flights. We study the expected maximum ${mathbb E}[M_n]$ of bridge RWs, i.e., RWs starting an
d ending at the origin after $n$ steps. We obtain an exact analytical expression for ${mathbb E}[M_n]$ valid for any $n$ and jump distribution $f(eta)$, which we then analyze in the large $n$ limit up to second leading order term. For jump distributions whose Fourier transform behaves, for small $k$, as $hat f(k) sim 1 - |a, k|^mu$ with a Levy index $0<mu leq 2$ and an arbitrary length scale $a>0$, we find that, at leading order for large $n$, ${mathbb E}[M_n]sim a, h_1(mu), n^{1/mu}$. We obtain an explicit expression for the amplitude $h_1(mu)$ and find that it carries the signature of the bridge condition, being different from its counterpart for the free random walk. For $mu=2$, we find that the second leading order term is a constant, which, quite remarkably, is the same as its counterpart for the free RW. For generic $0< mu < 2$, this second leading order term is a growing function of $n$, which depends non-trivially on further details of $hat f (k)$, beyond the Levy index $mu$. Finally, we apply our results to compute the mean perimeter of the convex hull of the $2d$ Rouse polymer chain and of the $2d$ run-and-tumble particle, as well as to the computation of the survival probability in a bridge version of the well-known lamb-lion capture problem.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
