Related papers: Eigenvalue distribution of optimal transportation
We provide a framework to approximate the 2-Wasserstein distance and the optimal transport map, amenable to efficient training as well as statistical and geometric analysis. With the quadratic cost and considering the Kantorovich dual form…
This article reviews the use of first order convex optimization schemes to solve the discretized dynamic optimal transport problem, initially proposed by Benamou and Brenier. We develop a staggered grid discretization that is well adapted…
We present an optimal transport framework for performing regression when both the covariate and the response are probability distributions on a compact Euclidean subset $\Omega\subset\mathbb{R}^d$, where $d>1$. Extending beyond compactly…
We prove that if $\Omega\subset \mathbb{R}^{n+1}$ is a (not necessarily strictly) convex, $C^1$ domain, and $\mu$ and $\bar{\mu}$ are probability measures absolutely continuous with respect to surface measure on $\partial \Omega$, with…
We compute analytically, for large N, the probability distribution of the number of positive eigenvalues (the index N_{+}) of a random NxN matrix belonging to Gaussian orthogonal (\beta=1), unitary (\beta=2) or symplectic (\beta=4)…
We explore the geometry of the Bures-Wasserstein space for potentially degenerate Gaussian measures on a separable Hilbert space. In this general setting, the optimal transport map is formally the subgradient of a convex function that is…
In this note we prove that in a metric measure space $(X, d, m)$ verifying the measure contraction property with parameters $K \in \mathbb{R}$ and $1< N< \infty$, any optimal transference plan between two marginal measures is induced by an…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
We propose a technique for calculating and understanding the eigenvalue distribution of sums of random matrices from the known distribution of the summands. The exact problem is formidably hard. One extreme approximation to the true density…
We consider optimal transportation of measures on metric and topological spaces in the case where the cost function and marginal distributions depend on a parameter with values in a metric space. The Hausdorff distance between the sets of…
We introduce a new non-linear optimal transport formulation for a pair of probability measures on $\mathbb{R}^d$ sharing a common barycentre, in which admissible transference plans satisfy two martingale-type constraints. This bi-martingale…
It is known that a matrix polynomial with unitary matrix coefficients has its eigenvalues in the annular region $\frac{1}{2} < |\lambda| < 2$. We prove in this short note that under certain assumptions, matrix polynomials with either doubly…
We provide a unifying interpretation of various optimal transport problems as a minimisation of a linear functional over the set of all Choquet representations of a given pair of probability measures ordered with respect to a certain convex…
Statistical properties of ensembles of random density matrices are investigated. We compute traces and von Neumann entropies averaged over ensembles of random density matrices distributed according to the Bures measure. The eigenvalues of…
We study the problem of estimating a function $T$ given independent samples from a distribution $P$ and from the pushforward distribution $T_\sharp P$. This setting is motivated by applications in the sciences, where $T$ represents the…
The transport properties of a bilayer graphene are studied theoretically within a self-consistent Born approximation. The electronic spectrum is composed of $k$-linear dispersion in the low-energy region and $k$-square dispersion as in an…
We provide a new proof of the known partial regularity result for the optimal transportation map (Brenier map) between two sets. Contrary to the existing regularity theory for the Monge-Amp{\`e}re equation, which is based on the maximum…
For $0<p<+\infty$, we prove a global $W^{2,p}$-estimate for potentials of optimal transport maps between convex domains in the plane. Among the tools developed for that purpose are obliqueness in general convex domains and estimates for the…
Over the past few years, numerous computational models have been developed to solve Optimal Transport (OT) in a stochastic setting, where distributions are represented by samples and where the goal is to find the closest map to the ground…
We study dynamical optimal transport metrics between density matrices associated to symmetric Dirichlet forms on finite-dimensional $C^*$-algebras. Our setting covers arbitrary skew-derivations and it provides a unified framework that…