SearcharxivSearch

arXiv · 2605.30560

Projected McKean--Vlasov Dynamics for Entropic Weak Optimal Transport

Abstract

Unlike classical optimal transport, weak transport costs depend nonlinearly on the conditional law of couplings. This feature is essential in problems involving barycenter, conditional moments, and martingale-type constraints. Meanwhile, such conditional dependence makes ordinary Wasserstein geometry insufficient and calls instead for an adapted Wasserstein viewpoint. In this paper, we investigate the entropy-regularized weak optimal transport via gradient flows in adapted Wasserstein space. We derive, from the formal tangent structure of adapted Wasserstein space and the projection onto the set of couplings with prescribed marginals, a coupled McKean--Vlasov SDE. A novel and subtle term is a projection that, at each $Y$-location, averages a weak-transport force that already depends on the conditional law of $Y$ given $X$, thereby preserving marginals while retaining the nonlinear weak-transport structure. Under mild integrability and regularity assumptions, we prove weak existence and uniqueness in law for this projected McKean--Vlasov equation. We then prove that the flow converges, in the adapted Wasserstein topology, to the unique minimizer of the entropic weak optimal transport problem. We also describe a particle approximation and illustrate the dynamics on optimal transport and martingale optimal transport examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Nathan Sauldubois, Xin Zhang. 2026-05-28. Projected McKean--Vlasov Dynamics for Entropic Weak Optimal Transport. https://arxiv.org/abs/2605.30560

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