Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAge representation of Levy walks: partial density waves, relaxation and first passage time statistics
66
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Levy walks (LWs) define a fundamental class of finite velocity stochastic processes that can be introduced as a special case of continuous time random walks. Alternatively, there is a hyperbolic representation of them in terms of partial probability density waves. Using the latter framework we explore the impact of aging on LWs, which can be viewed as a specific initial preparation of the particle ensemble with respect to an age distribution. We show that the hyperbolic age formulation is suitable for a simple integral representation in terms of linear Volterra equations for any initial preparation. On this basis relaxation properties and first passage time statistics in bounded domains are studied by connecting the latter problem with solute release kinetics. We find that even normal diffusive LWs may display anomalous relaxation properties such as stretched exponential decay. We then discuss the impact of aging on the first passage time statistics of LWs by developing the corresponding Volterra integral representation. As a further natural generalization the concept of LWs with wearing is introduced to account for mobility losses.
rate research
Read More
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 probability 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.
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 variance 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 present the analysis of the first passage time problem on a finite interval for the generalized Wiener process that is driven by Levy stable noises. The complexity of the first passage time statistics (mean first passage time, cumulative first passage time distribution) is elucidated together with a discussion of the proper setup of corresponding boundary conditions that correctly yield the statistics of first passages for these non-Gaussian noises. The validity of the method is tested numerically and compared against analytical formulae when the stability index $alpha$ approaches 2, recovering in this limit the standard results for the Fokker-Planck dynamics driven by Gaussian white noise.
We study the distribution of first-passage functionals ${cal A}= int_0^{t_f} x^n(t), dt$, where $x(t)$ is a Brownian motion (with or without drift) with diffusion constant $D$, starting at $x_0>0$, and $t_f$ is the first-passage time to the origin. In the driftless case, we compute exactly, for all $n>-2$, the probability density $P_n(A|x_0)=text{Prob}.(mathcal{A}=A)$. This probability density has an essential singular tail as $Ato 0$ and a power-law tail $sim A^{-(n+3)/(n+2)}$ as $Ato infty$. The former is reproduced by the optimal fluctuation method (OFM), which also predicts the optimal paths of the conditioned process for small $A$. For the case with a drift toward the origin, where no exact solution is known for general $n>-1$, the OFM predicts the distribution tails. For $Ato 0$ it predicts the same essential singular tail as in the driftless case. For $Ato infty$ it predicts a stretched exponential tail $-ln P_n(A|x_0)sim A^{1/(n+1)}$ for all $n>0$. In the limit of large Peclet number $text{Pe}= mu x_0/(2D)gg 1$, where $mu$ is the drift velocity, the OFM predicts a large-deviation scaling for all $A$: $-ln P_n(A|x_0)simeqtext{Pe}, Phi_nleft(z= A/bar{A}right)$, where $bar{A}=x_0^{n+1}/{mu(n+1)}$ is the mean value of $mathcal{A}$. We compute the rate function $Phi_n(z)$ analytically for all $n>-1$. For $n>0$ $Phi_n(z)$ is analytic for all $z$, but for $-1<n<0$ it is non-analytic at $z=1$, implying a dynamical phase transition. The order of this transition is $2$ for $-1/2<n<0$, while for $-1<n<-1/2$ the order of transition changes continuously with $n$. Finally, we apply the OFM to the case of $mu<0$ (drift away from the origin). We show that, when the process is conditioned on reaching the origin, the distribution of $mathcal{A}$ coincides with the distribution of $mathcal{A}$ for $mu>0$ with the same $|mu|$.
We perform an in-depth study for mean first-passage time (MFPT)---a primary quantity for random walks with numerous applications---of maximal-entropy random walks (MERW) performed in complex networks. For MERW in a general network, we derive an explicit expression of MFPT in terms of the eigenvalues and eigenvectors of the adjacency matrix associated with the network. For MERW in uncorrelated networks, we also provide a theoretical formula of MFPT at the mean-field level, based on which we further evaluate the dominant scalings of MFPT to different targets for MERW in uncorrelated scale-free networks, and compare the results with those corresponding to traditional unbiased random walks (TURW). We show that the MFPT to a hub node is much lower for MERW than for TURW. However, when the destination is a node with the least degree or a uniformly chosen node, the MFPT is higher for MERW than for TURW. Since MFPT to a uniformly chosen node measures real efficiency of search in networks, our work provides insight into general searching process in complex networks.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
