اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEntropy production related properties of first passage process
73
0
0.0
(
0
)
تأليف
Yunxin Zhang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
With nontrivial entropy production, first passage process is one of the most common nonequilibrium process in stochastic thermodynamics. Using one dimensional birth and death precess as a model framework, approximated expressions of mean first passage time (FPT), mean total number of jumps (TNJ), and their coefficients of variation (CV), are obtained for the case far from equilibrium. Consequently, uncertainty relations for FPT and TNJ are presented. Generally, mean FPT decreases exponentially with entropy production, while mean TNJ decreases exponentially first and then tends to a starting site dependent limit. For forward biased process, the CV of TNJ decreases exponentially with entropy production, while that of FPT decreases exponentially first and then tends to a starting site dependent limit. For backward biased process, both CVs of FPT and TNJ tend to one for large absolute values of entropy production. Related properties about the case of equilibrium are also addressed briefly for comparison.
قيم البحث
اقرأ أيضاً
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 study a stochastic process $X_t$ related to the Bessel and the Rayleigh processes, with various applications in physics, chemistry, biology, economics, finance and other fields. The stochastic differential equation is $dX_t = (nD/X_t) dt + sqrt{2D
} dW_t$, where $W_t$ is the Wiener process. Due to the singularity of the drift term for $X_t = 0$, different natures of boundary at the origin arise depending on the real parameter $n$: entrance, exit, and regular. For each of them we calculate analytically and numerically the probability density functions of first-passage times or first-exit times. Nontrivial behaviour is observed in the case of a regular boundary.
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.
We investigate the statistics of encounters of a diffusing particle with different subsets of the boundary of a confining domain. The encounters with each subset are characterized by the boundary local time on that subset. We extend a recently propos
ed approach to express the joint probability density of the particle position and of its multiple boundary local times via a multi-dimensional Laplace transform of the conventional propagator satisfying the diffusion equation with mixed Robin boundary conditions. In the particular cases of an interval, a circular annulus and a spherical shell, this representation can be explicitly inverted to access the statistics of two boundary local times. We provide the exact solutions and their probabilistic interpretation for the case of an interval and sketch their derivation for two other cases. We also obtain the distributions of various associated first-passage times and discuss their applications.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
