Weak and strong approximations of reflected diffusions via penalization methods

From MaRDI portal
Publication:1940231



Abstract: We study approximations of reflected It^o diffusions on convex subsets D of Rd by solutions of stochastic differential equations with penalization terms. We assume that the diffusion coefficients are merely measurable (possibly discontinuous) functions. In the case of Lipschitz continuous coefficients we give the rate of Lp approximation for every pgeq1. We prove that if D is a convex polyhedron then the rate is O((fraclnnn)1/2), and in the general case the rate is O((fraclnnn)1/4).


Reflected diffusions in a convex domain \(D\) with measurable coefficients are approximated by diffusions that penalize excursions outside \(D\), with a penalty proportional to the deviation from \(D\). In the infinite penalty limit, the latter are shown to approximate the weak, resp., strong, solutions of the former in law, resp., in probability, under conditions which are very general. Under stronger conditions, rate of convergence results are obtained in terms of bounds on the \(p\)-th moment, \(p \geq 1\), of the maximum distance between the trajectories on a compact time interval. Better bounds are shown to hold when \(D\) is a polyhedron.











This page was built for publication: Weak and strong approximations of reflected diffusions via penalization methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940231)