Brownian Convergence of Planar Domains and Stability of the Planar Skorokhod Embedding Problem

Abstract

We present a numerical framework for approximating the μ-domain in the planar Skorokhod embedding problem PSEP, recently introduced in gross2019. We show that under weak convergence of a sequence of probability measures (μn)n, the corresponding sequence of μn-domains converges, in an appropriate sense, to the domain associated with the limit measure μ. In addition, we provide implementation strategies, convergence rate estimates, and a numerical example. The method is robust and versatile, offering a concrete computational approach for the approximation of μ-domains. As part of this analysis, we introduce a novel mode of convergence for planar domains via planar Brownian motion, which we call p-Brownian convergence.

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…