SearcharxivSearch

arXiv · 2407.13002

Generalizing Super/Sub MOT using weak $L^1$ transport

Abstract

In this article we revisit the weak optimal transport (WOT) problem, introduced by Gozlan, Roberto, Samson and Tetali (2017). We work on the real line, with barycentric cost functions, and as our first result give the following characterization of the set of optimal couplings for two probability measures $\mu$ and $\nu$: every optimizer couples the left tails of $\mu$ and $\nu$ using a submartingale, the right tails using a supermartingale, while the central region is coupled using a martingale. We then consider a constrained optimal transport problem, where admissible transport plans are only those that are optimal for the WOT problem with $L^1$ costs. The constrained problem generalizes the (sub/super-) martingale optimal transport problems, studied by Beiglb\"ock and Juillet (2016), and Nutz and Stebegg (2018) among others. Finally, we introduce a generalized \textit{shadow measure} and establish its connection to the WOT. This extends and generalizes the results obtained in (sub/super-) martingale settings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erhan Bayraktar, Dominykas Norgilas. 2024-07-17. Generalizing Super/Sub MOT using weak $L^1$ transport. https://arxiv.org/abs/2407.13002

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