SearcharxivSearch

arXiv · 2506.23981

Wasserstein projections in the convex order: regularity and characterization in the quadratic Gaussian case

Abstract

In this paper, we first show continuity of both Wasserstein projections in the convex order when they are unique. We also check that, in arbitrary dimension $d$, the quadratic Wasserstein projection of a probability measure $\mu$ on the set of probability measures dominated by $\nu$ in the convex order is non-expansive in $\mu$ and H\"older continuous with exponent $1/2$ in $\nu$. When $\mu$ and $\nu$ are Gaussian, we check that this projection is Gaussian and also consider the quadratic Wasserstein projection on the set of probability measures $\nu$ dominating $\mu$ in the convex order. In the case when $d\ge 2$ and $\nu$ is not absolutely continuous with respect to the Lebesgue measure where uniqueness of the latter projection was not known, we check that there is always a unique Gaussian projection and characterize when non Gaussian projections with the same covariance matrix also exist. Still for Gaussian distributions, we characterize the covariance matrices of the two projections. It turns out that there exists an orthogonal transformation of space under which the computations are similar to the easy case when the covariance matrices of $\mu$ and $\nu$ are diagonal.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aurélien Alfonsi, Benjamin Jourdain. 2025-06-30. Wasserstein projections in the convex order: regularity and characterization in the quadratic Gaussian case. https://arxiv.org/abs/2506.23981

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