اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExact first-passage time distributions for three random diffusivity models
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the extremal properties of a stochastic process $x_t$ defined by a Langevin equation $dot{x}_t=sqrt{2 D_0 V(B_t)},xi_t$, where $xi_t$ is a Gaussian white noise with zero mean, $D_0$ is a constant scale factor, and $V(B_t)$ is a stochastic diffusivity (noise strength), which itself is a functional of independent Brownian motion $B_t$. We derive exact, compact expressions for the probability density functions (PDFs) of the first passage time (FPT) $t$ from a fixed location $x_0$ to the origin for three different realisations of the stochastic diffusivity: a cut-off case $V(B_t) =Theta(B_t)$ (Model I), where $Theta(x)$ is the Heaviside theta function; a Geometric Brownian Motion $V(B_t)=exp(B_t)$ (Model II); and a case with $V(B_t)=B_t^2$ (Model III). We realise that, rather surprisingly, the FPT PDF has exactly the Levy-Smirnov form (specific for standard Brownian motion) for Model II, which concurrently exhibits a strongly anomalous diffusion. For Models I and III either the left or right tails (or both) have a different functional dependence on time as compared to the Levy-Smirnov density. In all cases, the PDFs are broad such that already the first moment does not exist. Similar results are obtained in three dimensions for the FPT PDF to an absorbing spherical target.
قيم البحث
اقرأ أيضاً
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 the problem of computing first-passage time distributions for reaction processes modelled by master equations. We show that this generally intractable class of problems is equivalent to a sequential Bayesian inference problem for an auxil
iary observation process. The solution can be approximated efficiently by solving a closed set of coupled ordinary differential equations (for the low-order moments of the process) whose size scales with the number of species. We apply it to an epidemic model and a trimerisation process, and show good agreement with stochastic simulations.
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media, especially com
plex real networks, is a theoretical challenge. In this paper, we investigate a simple random walk on the the pseudofractal scale-free web (PSFW) with a perfect trap located at a node with the highest degree, which simultaneously exhibits the remarkable scale-free and small-world properties observed in real networks. We obtain the exact solution for the MFPT that is calculated through the recurrence relations derived from the structure of PSFW. The rigorous solution exhibits that the MFPT approximately increases as a power-law function of the number of nodes, with the exponent less than 1. We confirm the closed-form solution by direct numerical calculations. We show that the structure of PSFW can improve the efficiency of transport by diffusion, compared with some other structure, such as regular lattices, Sierpinski fractals, and T-graph. The analytical method can be applied to other deterministic networks, making the accurate computation of MFPT possible.
.Stochastic models based on random diffusivities, such as the diffusing-diffusivity approach, are popular concepts for the description of non-Gaussian diffusion in heterogeneous media. Studies of these models typically focus on the moments and the di
splacement probability density function. Here we develop the complementary power spectral description for a broad class of random diffusivity processes. In our approach we cater for typical single particle tracking data in which a small number of trajectories with finite duration are garnered. Apart from the diffusing-diffusivity model we study a range of previously unconsidered random diffusivity processes, for which we obtain exact forms of the probability density function. These new processes are differe
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 expli
cit 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
