Cavalletti, Fabio
Published in
Nonlinear Analysis

We prove the existence of solutions for the Monge minimization problem, addressed in a metric measure space (X,d,m) enjoying the Riemannian curvature-dimension condition RCD∗(K,N), with N

Bonnotte, Nicolas

The Brenier optimal map and the Knothe-Rosenblatt rearrangement are two instances of a transport map, that is to say a map sending one measure onto another. The main interest of the former is that it solves the Monge-Kantorovich optimal transport problem, while the latter is very easy to compute, being given by an explicit formula. A few years ago,...

Kloeckner, Benoit

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 absolutely continuous invariant measure is computed. In particular it is shown that 1 is an eigenvalue of infin...

Nolot, Vincent

The aim of this PhD is to study the optimal transportation theory in some abstract Wiener space. You can find the results in four main parts and they are aboutThe convexity of the relative entropy. We will extend the well known results in finite dimension to the Wiener space, endowed with the uniform norm. To be precise the relative entropy is (at ...

Bertrand, Jérôme Kloeckner, Benoit

We extend the geometric study of the Wasserstein space W(X) of a simply connected, negatively curved metric space X by investigating which pairs of boundary points can be linked by a geodesic, when X is a tree.

Bonciocat, Anca-Iuliana
Published in
Open Mathematics

We introduce and study a rough (approximate) curvature-dimension condition for metric measure spaces, applicable especially in the framework of discrete spaces and graphs. This condition extends the one introduced by Karl-Theodor Sturm, in his 2006 article On the geometry of metric measure spaces II, to a larger class of (possibly non-geodesic) met...

Papadakis, Nicolas Peyré, Gabriel Oudet, Edouard

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 to the computation of the $L^2$ optimal transport geodesic between distributions defined on a uniform spatial g...

Bouharguane, Afaf Iollo, Angelo Weynans, Lisl

We present an iterative method to numerically solve the L² Monge-Kantorovich problem. The method is based on a Picard fixed point iteration of the linearized problem. Examples relative to the transport of two-dimensional densities show that the present method can significantly reduce the computational time over existing methods, especially when the...

Bonneel, Nicolas Rabin, Julien Peyré, Gabriel Pfister, Hanspeter
Published in
Journal of Mathematical Imaging and Vision

This article details two approaches to compute barycenters of measures using 1-D Wasserstein distances along radial projections of the input measures. The first method makes use of the Radon transform of the measures, and the second is the solution of a convex optimization problem over the space of measures. We show several properties of these bary...

Louet, Jean

The optimal transportation problem was originally introduced by Monge in the 18th century; it consists in minimizing the total energy of the displacement of a given repartition of mass onto another given repartition of mass. This is mathematically expressed by: find the minimizer of the integral of c(x,T(x)) (where c(x,T(x)) is the cost to send x o...