Related papers: Optimal transport and Perelman's reduced volume
We consider the following geometric optics problem: Construct a system of two reflectors which transforms a spherical wavefront generated by a point source into a beam of parallel rays. This beam has a prescribed intensity distribution. We…
Regularising the primal formulation of optimal transport (OT) with a strictly convex term leads to enhanced numerical complexity and a denser transport plan. Many formulations impose a global constraint on the transport plan, for instance…
In this paper we introduce the log entropy functional and establish its monotonicity along the Ricci flow. One consequence of it is the monotonicity of the logarithmic Sobolev constant along the Ricci flow.
We consider deformations of metrics in a given conformal class such that the smallest eigenvalue of the Ricci tensor to be a constant. It is related to the notion of minimal volumes in comparison geometry. Such a metric with the smallest…
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…
We show that a class of Poincar\'e-Wirtinger inequalities on bounded convex sets can be obtained by means of the dynamical formulation of Optimal Transport. This is a consequence of a more general result valid for convex sets, possibly…
Under a complete Ricci flow, we construct a coupling of two Brownian motion such that their $\mathcal{L}_0$-distance is a supermartingale. This recovers a result of Lott [J. Lott, Optimal transport and Perelman's reduced volume, Calc. Var.…
We present a primal-dual dynamical formulation of the multi-marginal optimal transport problem for (semi-)convex cost functions. Even in the two-marginal setting, this formulation applies to cost functions not covered by the classical…
We develop a theory of optimal transport for stationary random measures with a focus on stationary point processes and construct a family of distances on the set of stationary random measures. These induce a natural notion of interpolation…
We prove a geometric linearisation result for minimisers of optimal transport problems where the cost-function is strongly p-convex and of p-growth. Initial and target measures are allowed to be rough, but are assumed to be close to…
A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…
$\mathscr{W}$-entropy and reduced volume for the Ricci flow were introduced by Perelman, which had proved their importance in the study of the Ricci flow. L. Ni studied the analogous concepts for the linear heat equation on the static…
We consider the problem of recovering the Riemannian metric on a compact closed manifold from the optimal transport maps when the underlying cost function is the squared Riemann distance. We show that the metric can be uniquely determined…
We develop an $\e$-regularity theory at the boundary for a general class of Monge-Amp\`ere type equations arising in optimal transportation. As a corollary we deduce that optimal transport maps between H\"older densities supported on $C^2$…
A basic idea in optimal transport is that optimizers can be characterized through a geometric property of their support sets called cyclical monotonicity. In recent years, similar "monotonicity principles" have found applications in other…
We find an explicit form of entropy solutions to a Riemann problem for a degenerate nonlinear parabolic equation with piecewise constant velocity and diffusion coefficients. It is demonstrated that this solution corresponds to the minimum…
Caffarelli's contraction theorem bounds the derivative of the optimal transport map between a log-convex measure and a strongly log-concave measure. We show that an analogous phenomenon holds on the level of the trace: The trace of the…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…
This paper introduces a dynamic formulation of divergence-regularized optimal transport with weak targets on the path space. In our formulation, the classical relative entropy penalty is replaced by a general convex divergence, and terminal…
We study the sample complexity of entropic optimal transport in high dimensions using computationally efficient plug-in estimators. We significantly advance the state of the art by establishing dimension-free, parametric rates for…