Skorokhod Embedding by Randomized Hitting Times

From MaRDI portal





For a general strong Markov process \(X\), the Skorokhod embedding problem consists in finding a (possibly randomized) stopping time \(T\) such that \(X_T\) has a prescribed distribution \(\mu\). As was first shown by \textit{H. Rost} [Z. Wahrscheinlichkeitstheor. Verw. Geb. 15, 19--28 (1970; Zbl 0192.53501)] such a stopping time exists if and only if the potential of \(\mu\) is dominated by that of the initial distribution of \(X\). The present paper shows that the stopping time \(T\) can be chosen to be a `` randomized hitting time. This means that there exists a monotone family of sets \((B(r),\;0\leq r\leq 1)\) such that \(T\) coincides with the hitting time of \(B(R)\) by \(X\), where \(R\) is a random variable uniformly distributed over \([0,1]\), independent of \(X\). The proof depends on tools of the general theory of Markov processes. [For the entire collection see Zbl 0716.00012.]











This page was built for publication: Skorokhod Embedding by Randomized Hitting Times

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