اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExact simulation of the first-passage time of diffusions
115
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Since diffusion processes arise in so many different fields, efficient tech-nics for the simulation of sample paths, like discretization schemes, represent crucial tools in applied probability. Such methods permit to obtain approximations of the first-passage times as a by-product. For efficiency reasons, it is particularly challenging to simulate directly this hitting time by avoiding to construct the whole paths. In the Brownian case, the distribution of the first-passage time is explicitly known and can be easily used for simulation purposes. The authors introduce a new rejection sampling algorithm which permits to perform an exact simulation of the first-passage time for general one-dimensional diffusion processes. The efficiency of the method, which is essentially based on Girsanovs transformation , is described through theoretical results and numerical examples.
قيم البحث
اقرأ أيضاً
Continuous-time stochastic processes play an important role in the description of random phenomena, it is therefore of prime interest to study particular variables depending on their paths, like stopping time for example. One approach consists in poi
nting out explicit expressions of the probability distributions, an other approach is rather based on the numerical generation of the random variables. We propose an algorithm in order to generate the first passage time through a given level of a one-dimensional jump diffusion. This process satisfies a stochastic differential equation driven by a Brownian motion and subject to random shocks characterized by an independent Poisson process. Our algorithm belongs to the family of rejection sampling procedures, also called exact simulation in this context: the outcome of the algorithm and the stopping time under consideration are identically distributed. It is based on both the exact simulation of the diffusion at a given time and on the exact simulation of first passage time for continuous diffusions. It is therefore based on an extension of the algorithm introduced by Herrmann and Zucca [16] in the continuous framework. The challenge here is to generate the exact position of a continuous diffusion conditionally to the fact that the given level has not been reached before. We present the construction of the algorithm and give numerical illustrations, conditions on the recurrence of jump diffusions are also discussed.
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
The first-passage-time problem for a Brownian motion with alternating infinitesimal moments through a constant boundary is considered under the assumption that the time intervals between consecutive changes of these moments are described by an altern
ating renewal process. Bounds to the first-passage-time density and distribution function are obtained, and a simulation procedure to estimate first-passage-time densities is constructed. Examples of applications to problems in environmental sciences and mathematical finance are also provided.
We study the time constant $mu(e_{1})$ in first passage percolation on $mathbb Z^{d}$ as a function of the dimension. We prove that if the passage times have finite mean, $$lim_{d to infty} frac{mu(e_{1}) d}{log d} = frac{1}{2a},$$ where $a in [0,inf
ty]$ is a constant that depends only on the behavior of the distribution of the passage times at $0$. For the same class of distributions, we also prove that the limit shape is not an Euclidean ball, nor a $d$-dimensional cube or diamond, provided that $d$ is large enough.
The simulation of exit times for diffusion processes is a challenging task since it concerns many applications in different fields like mathematical finance, neuroscience, reliability... The usual procedure is to use discretiza-tion schemes which unf
ortunately introduce some error in the target distribution. Our aim is to present a new algorithm which simulates exactly the exit time for one-dimensional diffusions. This acceptance-rejection algorithm requires to simulate exactly the exit time of the Brownian motion on one side and the Brownian position at a given time, constrained not to have exit before, on the other side. Crucial tools in this study are the Girsanov transformation, the convergent series method for the simulation of random variables and the classical rejection sampling. The efficiency of the method is described through theoretical results and numerical examples.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
