Weak and strong approximations of reflected diffusions via penalization methods
Leszek Slominski

TL;DR
This paper investigates how well penalized stochastic differential equations approximate reflected diffusions in convex sets, providing explicit convergence rates even with discontinuous coefficients and specific geometric conditions.
Contribution
It introduces new approximation rates for reflected diffusions using penalization methods, including cases with discontinuous coefficients and convex polyhedral domains.
Findings
Rate of $O((rac{ ext{ln} n}{n})^{1/2})$ for convex polyhedra
Rate of $O((rac{ ext{ln} n}{n})^{1/4})$ in general convex sets
Effective approximation with measurable, possibly discontinuous coefficients
Abstract
We study approximations of reflected It\^o diffusions on convex subsets of 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 approximation for every . We prove that if is a convex polyhedron then the rate is , and in the general case the rate is .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and financial applications · Mathematical Approximation and Integration · Markov Chains and Monte Carlo Methods
