اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSharp Asymptotic Estimates for Expectations, Probabilities, and Mean First Passage Times in Stochastic Systems with Small Noise
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Freidlin-Wentzell theory of large deviations can be used to compute the likelihood of extreme or rare events in stochastic dynamical systems via the solution of an optimization problem. The approach gives exponential estimates that often need to be refined via calculation of a prefactor. Here it is shown how to perform these computations in practice. Specifically, sharp asymptotic estimates are derived for expectations, probabilities, and mean first passage times in a form that is geared towards numerical purposes: they require solving well-posed matrix Riccati equations involving the minimizer of the Freidlin-Wentzell action as input, either forward or backward in time with appropriate initial or final conditions tailored to the estimate at hand. The usefulness of our approach is illustrated on several examples. In particular, invariant measure probabilities and mean first passage times are calculated in models involving stochastic partial differential equations of reaction-advection-diffusion type.
قيم البحث
اقرأ أيضاً
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 present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-cal
led global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target, and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow for a proper choice of highly connected target, is realized under the simple condition that the random walk is transient at the target site, and independently of the small-world, scale free or fractal properties of the network. Last, we put forward that the GMFPT to a specific target is not a representative property of the network, since the target averaged GMFPT satisfies much more restrictive bounds, which forbid any sublinear scaling with the network size.
Tight estimates of exit/containment probabilities are of particular importance in many control problems. Yet, estimating the exit/containment probabilities is non-trivial: even for linear systems (Ornstein-Uhlenbeck processes), the containment probab
ility can be computed exactly for only some particular values of the system parameters. In this paper, we derive tight bounds on the containment probability for a class of nonlinear stochastic systems. The core idea is to compare the pull strength (how hard the deterministic part of the system dynamics pulls towards the origin) experienced by the nonlinear system at hand with that of a well-chosen process for which tight estimates of the containment probability are known or can be numerically obtained (e.g. an Ornstein-Uhlenbeck process). Specifically, the main technical contribution of this paper is to define a suitable dominance relationship between the pull strengths of two systems and to prove that this dominance relationship implies an order relationship between their containment probabilities. We also discuss the link with contraction theory and highlight some examples of applications.
We derive an approximate but fully explicit formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape in a general elongated domain in the plane. Our approximation combines conformal mapping, boundary homogenisatio
n, and Fick-Jacobs equation to express the MFPT in terms of diffusivity and geometric parameters. A systematic comparison with a numerical solution of the original problem validates its accuracy when the starting point is not too close to the target. This is a practical tool for a rapid estimation of the MFPT for various applications in chemical physics and biology.
The determination of the mean first passage time (MFPT) for a Brownian particle in a bounded 2-D domain containing small absorbing traps is a fundamental problem with biophysical applications. The average MFPT is the expected capture time assuming a
uniform distribution of starting points for the random walk. We develop a hybrid asymptotic-numerical approach to predict optimal configurations of $m$ small stationary circular absorbing traps that minimize the average MFPT in near-disk and elliptical domains. For a general class of near-disk domains, we illustrate through several specific examples how simple, but yet highly accurate, numerical methods can be used to implement the asymptotic theory. From the derivation of a new explicit formula for the Neumann Greens function and its regular part for the ellipse, a numerical approach based on our asymptotic theory is used to investigate how the spatial distribution of the optimal trap locations changes as the aspect ratio of an ellipse of fixed area is varied. The results from the hybrid theory for the ellipse are compared with full PDE numerical results computed from the closest point method cite{IWWC2019}. For long and thin ellipses, it is shown that the optimal trap pattern for $m=2,ldots,5$ identical traps is collinear along the semi-major axis of the ellipse. For such essentially 1-D patterns, a thin-domain asymptotic analysis is formulated and implemented to accurately predict the optimal locations of collinear trap patterns and the corresponding optimal average MFPT.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
