SearcharxivSearch

arXiv · 1201.5321

Embedding laws in diffusions by functions of time

Abstract

We present a constructive probabilistic proof of the fact that if $B=(B_t)_{t\ge0}$ is standard Brownian motion started at $0$, and $μ$ is a given probability measure on $\mathbb{R}$ such that $μ(\{0\})=0$, then there exists a unique left-continuous increasing function $b:(0,\infty)\rightarrow\mathbb{R}\cup\{+\infty\}$ and a unique left-continuous decreasing function $c:(0,\infty)\rightarrow\mathbb{R}\cup\{-\infty\}$ such that $B$ stopped at $τ_{b,c}=\inf\{t>0\vert B_t\ge b(t)$ or $B_t\le c(t)\}$ has the law $μ$. The method of proof relies upon weak convergence arguments arising from Helly's selection theorem and makes use of the Lévy metric which appears to be novel in the context of embedding theorems. We show that $τ_{b,c}$ is minimal in the sense of Monroe so that the stopped process $B^{τ_{b,c}}=(B_{t\wedgeτ_{b,c}})_{t\ge0}$ satisfies natural uniform integrability conditions expressed in terms of $μ$. We also show that $τ_{b,c}$ has the smallest truncated expectation among all stopping times that embed $μ$ into $B$. The main results extend from standard Brownian motion to all recurrent diffusion processes on the real line.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. M. G. Cox, G. Peskir. 2015-10-28. Embedding laws in diffusions by functions of time. https://doi.org/10.1214/14-aop941

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