اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUnbiased simulation of stochastic differential equations
214
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose an unbiased Monte-Carlo estimator for $mathbb{E}[g(X_{t_1}, cdots, X_{t_n})]$, where $X$ is a diffusion process defined by a multi-dimensional stochastic differential equation (SDE). The main idea is to start instead from a well-chosen simulatable SDE whose coefficients are updated at independent exponential times. Such a simulatable process can be viewed as a regime-switching SDE, or as a branching diffusion process with one single living particle at all times. In order to compensate for the change of the coefficients of the SDE, our main representation result relies on the automatic differentiation technique induced by Bismu-Elworthy-Li formula from Malliavin calculus, as exploited by Fournie et al.(1999) for the simulation of the Greeks in financial applications. In particular, this algorithm can be considered as a variation of the (infinite variance) estimator obtained in Bally and Kohatsu-Higa [Section 6.1](2014) as an application of the parametrix method.
قيم البحث
اقرأ أيضاً
We consider a general class of high order weak approximation schemes for stochastic differential equations driven by Levy processes with infinite activity. These schemes combine a compound Poisson approximation for the jump part of the Levy process w
ith a high order scheme for the Brownian driven component, applied between the jump times. The overall approximation is analyzed using a stochastic splitting argument. The resulting error bound involves separate contributions of the compound Poisson approximation and of the discretization scheme for the Brownian part, and allows, on one hand, to balance the two contributions in order to minimize the computational time, and on the other hand, to study the optimal design of the approximating compound Poisson process. For driving processes whose Levy measure explodes near zero in a regularly varying way, this procedure allows to construct discretization schemes with arbitrary order of convergence.
The BMO martingale theory is extensively used to study nonlinear multi-dimensional stochastic equations (SEs) in $cR^p$ ($pin [1, infty)$) and backward stochastic differential equations (BSDEs) in $cR^ptimes cH^p$ ($pin (1, infty)$) and in $cR^inftyt
imes bar{cH^infty}^{BMO}$, with the coefficients being allowed to be unbounded. In particular, the probabilistic version of Feffermans inequality plays a crucial role in the development of our theory, which seems to be new. Several new results are consequently obtained. The particular multi-dimensional linear case for SDEs and BSDEs are separately investigated, and the existence and uniqueness of a solution is connected to the property that the elementary solutions-matrix for the associated homogeneous SDE satisfies the reverse Holder inequality for some suitable exponent $pge 1$. Finally, we establish some relations between Kazamakis quadratic critical exponent $b(M)$ of a BMO martingale $M$ and the spectral radius of the solution operator for the $M$-driven SDE, which lead to a characterization of Kazamakis quadratic critical exponent of BMO martingales being infinite.
In this paper we discuss new types of differential equations which we call anticipated backward stochastic differential equations (anticipated BSDEs). In these equations the generator includes not only the values of solutions of the present but also
the future. We show that these anticipated BSDEs have unique solutions, a comparison theorem for their solutions, and a duality between them and stochastic differential delay equations.
Due to their intrinsic link with nonlinear Fokker-Planck equations and many other applications, distribution dependent stochastic differential equations (DDSDEs for short) have been intensively investigated. In this paper we summarize some recent pro
gresses in the study of DDSDEs, which include the correspondence of weak solutions and nonlinear Fokker-Planck equations, the well-posedness, regularity estimates, exponential ergodicity, long time large deviations, and comparison theorems.
We develop and analyze a method, density tracking by quadrature (DTQ), to compute the probability density function of the solution of a stochastic differential equation. The derivation of the method begins with the discretization in time of the stoch
astic differential equation, resulting in a discrete-time Markov chain with continuous state space. At each time step, DTQ applies quadrature to solve the Chapman-Kolmogorov equation for this Markov chain. In this paper, we focus on a particular case of the DTQ method that arises from applying the Euler-Maruyama method in time and the trapezoidal quadrature rule in space. Our main result establishes that the density computed by DTQ converges in $L^1$ to both the exact density of the Markov chain (with exponential convergence rate), and to the exact density of the stochastic differential equation (with first-order convergence rate). We establish a Chernoff bound that implies convergence of a domain-truncated version of DTQ. We carry out numerical tests to show that the empirical performance of DTQ matches theoretical results, and also to demonstrate that DTQ can compute densities several times faster than a Fokker-Planck solver, for the same level of error.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
