Related papers: A new transportation distance with bulk/interface …
We consider an optimal transportation problem with more than two marginals. We use a family of semi-Riemannian metrics derived from the mixed, second order partial derivatives of the cost function to provide upper bounds for the dimension…
In classical optimal transport, the contributions of Benamou-Brenier and McCann regarding the time-dependent version of the problem are cornerstones of the field and form the basis for a variety of applications in other mathematical areas.…
The problem of branched transportation aims to describe the movement of masses when, due to concavity effects, they have the interest to travel together as much as possible, because the cost for a path of length
This paper defines a new transport metric over the space of non-negative measures. This metric interpolates between the quadratic Wasserstein and the Fisher-Rao metrics and generalizes optimal transport to measures with different masses. It…
Optimal transport distances have found many applications in machine learning for their capacity to compare non-parametric probability distributions. Yet their algorithmic complexity generally prevents their direct use on large scale…
We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We…
We consider the problem of optimal exchange which can be formulated as a kind of optimal transportation problem. The existence of an optimal solution and a duality theorem for the optimal exchange problem are proved in case of completely…
We study the consequences of the equivalence between the least gradient problem and a boundary-to-boundary optimal transport problem in two dimensions. We extend the relationship between the two problems to their respective dual problems,…
In this paper, we are interested in the analysis of a well-known free boundary/shape optimization problem motivated by some issues arising in population dynamics. The question is to determine optimal spatial arrangements of favorable and…
Inspired by the matching of supply to demand in logistical problems, the optimal transport (or Monge--Kantorovich) problem involves the matching of probability distributions defined over a geometric domain such as a surface or manifold. In…
We consider a parabolic version of the mass transport problem, and show that it converges to a solution of the original mass transport problem under suitable conditions on the cost function, and initial and target domains.
In this work, we construct a novel numerical method for solving the multi-marginal optimal transport problems with Coulomb cost. This type of optimal transport problems arises in quantum physics and plays an important role in understanding…
The optimal transport problem is studied in the context of Lorentz-Finsler geometry. For globally hyperbolic Lorentz-Finsler spacetimes the first Kantorovich problem and the Monge problem are solved. Further the intermediate regularity of…
We find interpretation using optimal mass transport theory for eigenvalue problems obtained as limits of the eigenvalue problems for the fractional $p-$Laplacian operators as $p\to +\infty$. We deal both with Dirichlet and Neumann boundary…
The goal of this paper is to address some optimal control and shape optimisation problems arising from bulk-surface cooperative systems. The basic model under consideration is the following: letting $\Omega$ be a fixed domain, we assume…
Models involving branched structures are employed to describe several supply-demand systems such as the structure of the nerves of a leaf, the system of roots of a tree and the nervous or cardiovascular systems. Given a flow (traffic path)…
We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability…
We propose a fast algorithm to approximate the optimal transport distance. The main idea is to add a Fisher information regularization into the dynamical setting of the problem, originated by Benamou and Brenier. The regularized problem is…
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…
The fundamental theorem of classical optimal transport establishes strong duality and characterizes optimizers through a complementary slackness condition. Milestones such as Brenier's theorem and the Kantorovich-Rubinstein formula are…