اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExact solution for mean first-passage time on a pseudofractal scale-free web
393
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 complex 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.
قيم البحث
اقرأ أيضاً
In this paper, we consider discrete time random walks on the pseudofractal scale-free web (PSFW) and we study analytically the related first passage properties. First, we classify the nodes of the PSFW into different levels and propose a method to de
rive the generation function of the first passage probability from an arbitrary starting node to the absorbing domain, which is located at one or more nodes of low-level (i.e., nodes with large degree). Then, we calculate exactly the first passage probability, the survival probability, the mean and the variance of first passage time by using the generating functions as a tool. Finally, for some illustrative examples corresponding to given choices of starting node and absorbing domain, we derive exact and explicit results for such first passage properties. The method we propose can as well address the cases where the absorbing domain is located at one or more nodes of high-level on the PSFW, and it can also be used to calculate the first passage properties on other networks with self-similar structure, such as $(u, v)$ flowers and recursive scale-free trees.
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 di
ffusivity (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 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 pas
sage 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.
Fractal phenomena may be widely observed in a great number of complex systems. In this paper, we revisit the well-known Vicsek fractal, and study some of its structural properties for purpose of understanding how the underlying topology influences it
s dynamic behaviors. For instance, we analytically determine the exact solution to mean first-passage time for random walks on Vicsek fractal in a more light mapping-based manner than previous other methods, including typical spectral technique. More importantly, our method can be quite efficient to precisely calculate the solutions to mean first-passage time on all generaliz
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
