Related papers: Monge solutions and uniqueness in multi-marginal o…
In order to circumvent the difficulties in solving numerically the discrete optimal transport problem, in which one minimizes the linear target function $P\mapsto\langle C,P\rangle:=\sum_{i,j}C_{ij}P_{ij}$, Cuturi introduced a variant of…
It is well known that the quadratic-cost optimal transportation problem is formally equivalent to the second boundary value problem for the Monge-Amp\`ere equation. Viscosity solutions are a powerful tool for analysing and approximating…
In this paper we introduce a unifying approach to the generalized Tur\'an problem and supersaturation results in graph theory. The supersaturation-extremal function $satex(n, F : m, G)$ is the least number of copies of a subgraph $G$ an…
In this note we will adapt Topping's $\mathcal{L}$-optimal transportation theory for Ricci flow to a more general situation, i.e. to a closed manifold $(M,g_{ij}(t))$ evolving by $\partial_tg_{ij}=-2S_{ij}$, where $S_{ij}$ is a symmetric…
This paper slightly improves a classical result by Gangbo and McCann (1996) about the structure of optimal transport plans for costs that are concave functions of the Euclidean distance. Since the main difficulty for proving the existence…
This paper is concerned with the study of the Monge optimal transport problem in sub-Riemannian manifolds where the cost is given by the square of the sub-Riemannian distance. Our aim is to extend previous results on existence and…
We consider so-called branched transport and variants thereof in two space dimensions. In these models one seeks an optimal transportation network for a given mass transportation task. In two space dimensions, they are closely connected to…
In this paper we study a variant of the branched transportation problem, that we call multi-material transport problem. This is a transportation problem, where distinct commodities are transported simultaneously along a network. The cost of…
For a finite metric graph $X=(V,E,\ell)$, where $V$ is endowed with the shortest path metric, we consider the transportation cost problem associated with the distance $d$ on $V$. Namely, for $f$ a function with total sum 0 on $V$, write…
In this paper we consider Monge-Amp\`ere equations on compact Hessian manifolds, or equivalently Monge-Amp\`ere equations on certain unbounded convex domains $\Omega\subseteq \mathbb{R}^n$, with a periodicity constraint given by the action…
In this work we propose a batch version of the Greenkhorn algorithm for multimarginal regularized optimal transport problems. Our framework is general enough to cover, as particular cases, some existing algorithms like Sinkhorn and…
We present a systematic study of conditional triangular transport maps in function spaces from the perspective of optimal transportation and with a view towards amortized Bayesian inference. More specifically, we develop a theory of…
We establish that solving an optimal transportation problem in which the source and target densities are defined on manifolds with different dimensions, is equivalent to solving a new nonlocal analog of the Monge-Amp\`ere equation,…
In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…
We study the structural properties of multi-period martingale optimal transport (MOT). We develop new tools to address these problems, and use them to prove several uniqueness and structural results on three-period martingale optimal…
The time-discretized, spatially continuous generalized Euler equations are a prototype example of multi-marginal optimal transport, yet the question whether they exhibit mass-splitting (or equivalently, whether they have solutions that are…
Motivated by conjectures in Mirror Symmetry, we continue the study of the real Monge--Amp\`ere operator on the boundary of a simplex. This can be formulated in terms of optimal transport, and we consider, more generally, the problem of…
We consider the numerical construction of minimal Lagrangian graphs, which is related to recent applications in materials science, molecular engineering, and theoretical physics. It is known that this problem can be formulated as an…
We introduce a convergent finite difference method for solving the optimal transportation problem on the sphere. The method applies to both the traditional squared geodesic cost (arising in mesh generation) and a logarithmic cost (arising…
Recent advances in large-scale optimal transport have greatly extended its application scenarios in machine learning. However, existing methods either not explicitly learn the transport map or do not support general cost function. In this…