SearcharxivSearch

arXiv · 1703.05673

On Skorokhod Embeddings and Poisson Equations

Abstract

The classical Skorokhod embedding problem for a Brownian motion $W$ asks to find a stopping time $τ$ so that $W_τ$ is distributed according to a prescribed probability distribution $μ$. Many solutions have been proposed during the past 50 years and applications in different fields emerged. This article deals with a generalized Skorokhod embedding problem (SEP): Let $X$ be a Markov process with initial marginal distribution $μ_0$ and let $μ_1$ be a probability measure. The task is to find a stopping time $τ$ such that $X_τ$ is distributed according to $μ_1$. More precisely, we study the question of deciding if a finite mean solution to the SEP can exist for given $μ_0, μ_1$ and the task of giving a solution which is as explicit as possible. If $μ_0$ and $μ_1$ have positive densities $h_0$ and $h_1$ and the generator $\mathcal A$ of $X$ has a formal adjoint operator $\mathcal A^*$, then we propose necessary and sufficient conditions for the existence of an embedding in terms of the Poisson equation $\mathcal A^* H=h_1-h_0$ and give a fairly explicit construction of the stopping time using the solution of the Poisson equation. For the class of Lévy processes we carry out the procedure and extend a result of Bertoin and Le Jan to Lévy processes without local times.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leif Doering, Lukas Gonon, David J. Prömel, Oleg Reichmann. 2019-07-31. On Skorokhod Embeddings and Poisson Equations. https://doi.org/10.1214/18-aap1454

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR