SearcharxivSearch

arXiv · 1609.03340

Shadow couplings

Abstract

A classical result of Strassen asserts that given probabilities $\mu, \nu$ on the real line which are in convex order, there exists a \emph{martingale coupling} with these marginals, i.e.\ a random vector $(X_1,X_2)$ such that $X_1\sim \mu, X_2\sim \nu$ and $E[X_2|X_1]=X_1$. Remarkably, it is a non trivial problem to construct particular solutions to this problem. In this article, we introduce a family of such martingale couplings, each of which admits several characterizations in terms of optimality properties / geometry of the support set / representation through a Skorokhod embedding. As a particular element of this family we recover the (left-) curtain martingale transport, which has recently been studied \cite{BeJu16, HeTo13, CaLaMa14, BeHeTo15} and which can be viewed as a martingale analogue of the classical monotone rearrangement. As another canonical element of this family we identify a martingale coupling that resembles the usual \emph{product coupling} and appears as an optimizer in the general transport problem recently introduced by Gozlan et al. In addition, this coupling provides an explicit example of a Lipschitz-kernel, shedding new light on Kellerer's proof of the existence of Markov martingales with specified marginals.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathias Beiglboeck, Nicolas Juillet. 2016-09-12. Shadow couplings. https://arxiv.org/abs/1609.03340

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