Related papers: Transportation onto log-Lipschitz perturbations
Optimal transport provides an inherently geometric and highly structured framework for studying spaces of probability measures, supplying a rich theoretical toolkit for contemporary statistics, machine learning, and generative modelling. In…
Using optimal transport we study some dynamical properties of expanding circle maps acting on measures by push-forward. Using the definition of the tangent space to the space of measures introduced by Gigli, their derivative at the unique…
In this paper, we give necessary and sufficient conditions for Talagrand's like transportation cost inequalities on the real line. This brings a new wide class of examples of probability measures enjoying a dimension-free concentration of…
We consider random walk in a space-time random potential, also known as directed random polymer measures, on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices. We construct covariant cocycles…
We prove a new smoothing type property for solutions of the 1d quintic Schr\"odinger equation. As a consequence, we prove that a family of natural gaussian measures are quasi-invariant under the flow of this equation. In the defocusing…
We introduce Gaussian-type measures on the manifold of all metrics with a fixed volume form on a compact Riemannian manifold of dimension $\geq 3$. For this random model we compute the characteristic function for the $L^2$ (Ebin) distance…
We give a sufficient and necessary condition for a probability measure $\mu$ on the real line to satisfy the logarithmic Sobolev inequality for convex functions. The condition is expressed in terms of the unique left-continuous and…
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…
We show that in a locally compact complete $CAT(0)$ space satisfying positive angles property and a disintegration regularity for its canonical Hausdorff measure, there exists a unique optimal transport map that push-forwards a given…
This article presents a general approximation-theoretic framework to analyze measure transport algorithms for probabilistic modeling. A primary motivating application for such algorithms is sampling -- a central task in statistical…
We consider the inverse problem of determining the permeability from the pressure in a Darcy model of flow in a porous medium. Mathematically the problem is to find the diffusion coefficient for a linear uniformly elliptic partial…
The function that maps a family of probability measures to the solution of the dual entropic optimal transport problem is known as the Schr\"odinger map. We prove that when the cost function is $\mathcal{C}^{k+1}$ with $k\in \mathbb{N}^*$…
In recent years, Bayesian inference in large-scale inverse problems found in science, engineering and machine learning has gained significant attention. This paper examines the robustness of the Bayesian approach by analyzing the stability…
The paper is devoted to provide Michael-Simon-type $L^p$-logarithmic-Sobolev inequalities on complete, not necessarily compact $n$-dimensional submanifolds $\Sigma$ of the Euclidean space $\mathbb R^{n+m}$. Our first result, stated for…
We study optimal transportation of measures on compact manifolds for costs defined from convex Lagrangians. We prove that optimal transportation can be interpolated by measured Lipschitz laminations, or geometric currents. The methods are…
We explore alternative functional or transport-entropy formulations of the Blaschke-Santal{\'o} inequality and of its conjectured counterpart due to Mahler. In particular, we obtain new direct and reverse Blaschke-Santal{\'o} inequalities…
In this paper, we study the Lipschitz continuous dependence of conservative H\"older continuous weak solutions to a variational wave system derived from a model for nematic liquid crystals. Since the solution of this system generally forms…
Applications in data science, shape analysis and object classification frequently require comparison of probability distributions defined on different ambient spaces. To accomplish this, one requires a notion of distance on a given class of…
Inspired by the recent theory of Entropy-Transport problems and by the $\mathbf{D}$-distance of Sturm on normalised metric measure spaces, we define a new class of complete and separable distances between metric measure spaces of possibly…
In this paper, we extend the scope of Caffarelli's contraction theorem, which provides a measure of the Lipschitz constant for optimal transport maps between log-concave probability densities in $\R^d$. Our focus is on a broader category of…