A Numerical scheme to approximate the solution of the planar Skorokhod embedding problem

Abstract

We present a numerical framework to approximate the μ-domain in the planar Skorokhod embedding problem (PSEP), recently appeared in gross2019. Our approach investigates the continuity and convergence properties of the solutions with respect to the underlying distribution μ. We establish that, under weak convergence of a sequence of probability measures (μn) with bounded support, the corresponding sequence of μn-domains converges to the domain associated with μ, limit of (μn). We derive explicit convergence results in the L1 norm, supported by a generalization using the concept of αp-convergence. Furthermore, we provide practical implementation techniques, convergence rate estimates, and numerical simulations using various distributions. The method proves robust and adaptable, offering a concrete computational pathway for approximating μ-domains in the PSEP.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…