SearcharxivSearch

arXiv · 2207.11732

Supermartingale shadow couplings: the decreasing case

Abstract

For two measures $\mu$ and $\nu$ that are in convex-decreasing order, Nutz and Stebegg (Canonical supermartingale couplings, Ann. Probab., 46(6):3351--3398, 2018) studied the optimal transport problem with supermartingale constraints and introduced two canonical couplings, namely the increasing and decreasing transport plans, that are optimal for a large class of cost functions. In the present paper we provide an explicit construction of the decreasing coupling $\pi^D$ by establishing a Brenier-type result: (a generalised version of) $\pi^D$ concentrates on the graphs of two functions. Our construction is based on the concept of the supermartingale \textit{shadow} measure and requires a suitable extension of the results by Juillet (Stability of the shadow projection and the left-curtain coupling, Ann. Inst. H. Poincar\'e Probab. Statist., 52(4):1823--1843, November 2016) and Beiglb\"ock and Juillet (Shadow couplings, Trans. Amer. Math. Soc., 374:4973--5002, 2021) established in the martingale setting. In particular, we prove the stability of the supermartingale shadow measure with respect to initial and target measures $\mu,\nu$, introduce an infinite family of lifted supermartingale couplings that arise via shadow measure, and show how to explicitly determine the `martingale points' of each such coupling.

Explore related subjects

Keep this discovery

BibTeXRIS

Erhan Bayraktar, Shuoqing Deng, Dominykas Norgilas. 2022-07-24. Supermartingale shadow couplings: the decreasing case. https://arxiv.org/abs/2207.11732

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