ترغب بنشر مسار تعليمي؟ اضغط هنا

Density Tracking by Quadrature for Stochastic Differential Equations

75   0   0.0 ( 0 )
 نشر من قبل Harish S. Bhat
 تاريخ النشر 2016
  مجال البحث الاحصاء الرياضي
والبحث باللغة English




اسأل ChatGPT حول البحث

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 stochastic 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.



قيم البحث

اقرأ أيضاً

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 sim ulatable 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 develop algorithms for computing expectations of the laws of models associated to stochastic differential equations (SDEs) driven by pure Levy processes. We consider filtering such processes and well as pricing of path dependent options. We propos e a multilevel particle filter (MLPF) to address the computational issues involved in solving these continuum problems. We show via numerical simulations and theoretical results that under suitable assumptions of the discretization of the underlying driving Levy proccess, our proposed method achieves optimal convergence rates. The cost to obtain MSE $O(epsilon^2)$ scales like $O(epsilon^{-2})$ for our method, as compared with the standard particle filter $O(epsilon^{-3})$.
We identify the stochastic processes associated with one-sided fractional partial differential equations on a bounded domain with various boundary conditions. This is essential for modelling using spatial fractional derivatives. We show well-posednes s of the associated Cauchy problems in $C_0(Omega)$ and $L_1(Omega)$. In order to do so we develop a new method of embedding finite state Markov processes into Feller processes and then show convergence of the respective Feller processes. This also gives a numerical approximation of the solution. The proof of well-posedness closes a gap in many numerical algorithm articles approximating solutions to fractional differential equations that use the Lax-Richtmyer Equivalence Theorem to prove convergence without checking well-posedness.
65 - Qi Feng , Wuchen Li 2021
We study convergence behaviors of degenerate and non-reversible stochastic differential equations. Our method follows a Lyapunov method in probability density space, in which the Lyapunov functional is chosen as a weighted relative Fisher information functional. We construct a weighted Fisher information induced Gamma calculus method with a structure condition. Under this condition, an explicit algebraic tensor is derived to guarantee the convergence rate for the probability density function converging to its invariant distribution. We provide an analytical example for underdamped Langevin dynamics with variable diffusion coefficients.
We develop in this work a numerical method for stochastic differential equations (SDEs) with weak second order accuracy based on Gaussian mixture. Unlike the conventional higher order schemes for SDEs based on It^o-Taylor expansion and iterated It^o integrals, the proposed scheme approximates the probability measure $mu(X^{n+1}|X^n=x_n)$ by a mixture of Gaussians. The solution at next time step $X^{n+1}$ is then drawn from the Gaussian mixture with complexity linear in the dimension $d$. This provides a new general strategy to construct efficient high weak order numerical schemes for SDEs.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا