اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA monotone scheme for G-equations with application to the explicit convergence rate of robust central limit theorem
112
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a monotone approximation scheme for a class of fully nonlinear PDEs called G-equations. Such equations arise often in the characterization of G-distributed random variables in a sublinear expectation space. The proposed scheme is constructed recursively based on a piecewise constant approximation of the viscosity solution to the G-equation. We establish the convergence of the scheme and determine the convergence rate with an explicit error bound, using the comparison principles for both the scheme and the equation together with a mollification procedure. The first application is obtaining the convergence rate of Pengs robust central limit theorem with an explicit bound of Berry-Esseen type. The second application is an approximation scheme with its convergence rate for the Black-Scholes-Barenblatt equation.
قيم البحث
اقرأ أيضاً
In this paper, we propose a monotone approximation scheme for a class of fully nonlinear partial integro-differential equations (PIDEs) which characterize the nonlinear $alpha$-stable L{e}vy processes under sublinear expectation space with $alpha in(
1,2)$. Two main results are obtained: (i) the error bounds for the monotone approximation scheme of nonlinear PIDEs, and (ii) the convergence rates of a generalized central limit theorem of Bayraktar-Munk for $alpha$-stable random variables under sublinear expectation. Our proofs use and extend techniques introduced by Krylov and Barles-Jakobsen.
In this paper we present a scheme for the numerical solution of one-dimensional stochastic differential equations (SDEs) whose drift belongs to a fractional Sobolev space of negative regularity (a subspace of Schwartz distributions). We obtain a rate
of convergence in a suitable $L^1$-norm and we implement the scheme numerically. To the best of our knowledge this is the first paper to study (and implement) numerical solutions of SDEs whose drift lives in a space of distributions. As a byproduct we also obtain an estimate of the convergence rate for a numerical scheme applied to SDEs with drift in $L^p$-spaces with $pin(1,infty)$.
We give a new proof of the classical Central Limit Theorem, in the Mallows ($L^r$-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality related t
o this metric. The key is to analyse the case where equality holds. We provide some results concerning rates of convergence. We also consider convergence to stable distributions, and obtain a bound on the rate of such convergence.
Under the Kolmogorov--Smirnov metric, an upper bound on the rate of convergence to the Gaussian distribution is obtained for linear statistics of the matrix ensembles in the case of the Gaussian, Laguerre, and Jacobi weights. The main lemma gives an
estimate for the characteristic functions of the linear statistics; this estimate is uniform over the growing interval. The proof of the lemma relies on the Riemann--Hilbert approach.
By employing a system of interacting stochastic particles as an approximation of the McKean--Vlasov equation and utilizing classical stochastic analysis tools, namely It^os formula and Kolmogorov--Chentsov continuity theorem, we prove the existence a
nd uniqueness of strong solutions for a broad class of McKean--Vlasov equations. Considering an increasing number of particles in the approximating stochastic particle system, we also prove the $L^p$ strong convergence rate and derive the weak convergence rates using the Kolmogorov backward equation and variations of the stochastic particle system. Our convergence rates were verified by numerical experiments which also indicate that the assumptions made here and in the literature can be relaxed.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
