相关论文: Regularity for the optimal transportation problem …
A quadratic optimal transport metric on the set of probability measure over $\R^2$ is introduced. The quadratic cost is given by the euclidean norm on $\R^2$ associated to some well chosen symmetric positive matrix, which makes the metric…
We investigate the small regularization limit of entropic optimal transport when the cost function is the Euclidean distance in dimensions $d > 1$, and the marginal measures are absolutely continuous with respect to the Lebesgue measure.…
In his book on Convex Polyhedra (section 7.2), A.D. Aleksandrov raised a general question of finding variational statements and proofs of existence of polytopes with given geometric data. The first goal of this paper is to give a…
The paper considers the Euler system of PDE on a smooth compact Riemannian manifold of positive curvature without boundary, and the sphere ${\mathbb{S}}^2$ in particular. The paper interprets the Euler equations as a transport problem for…
We develop a mathematical theory of entropic regularisation of unbalanced optimal transport problems. Focusing on static formulation and relying on the formalism developed for the unregularised case, we show that unbalanced optimal…
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 the regularity of optimal transportation potentials defined on round spheres is investigated. Specifically, this research generalises the calculations done by Loeper, where he showed that the strong (A3) condition of Trudinger…
We consider the optimal transportation problem on a globally hyperbolic spacetime for some cost function $c_2$, which corresponds to the optimal transportation problem on a complete Riemannian manifold where the cost function is the…
We introduce and study a simple model capturing the main features of unbalanced optimal transport. It is based on equipping the conical extension of the group of all diffeomorphisms with a natural metric, which allows a Riemannian…
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…
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 the problem of optimal incomplete transportation between the empirical measure on an i.i.d. uniform sample on the d-dimensional unit cube $[0,1]^d$ and the true measure. This is a family of problems lying in between classical…
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 this short note, we consider the problem of prescribing the Gauss curvature and image of the Gauss map for the graph of a function over a domain in Euclidean space. The prescription of the image of the Gauss map turns this into a second…
If the cost function is not too far from the Euclidean cost, then the optimal map transporting Gaussians restricted to a ball will be regular. \ Similarly, given any cost function which is smooth in a neighborhood of two points on a…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We establish the stability of solutions to the entropically regularized optimal transport problem with respect to the marginals and the cost function. The result is based on the geometric notion of cyclical invariance and inspired by the…
The diffeomorphic registration framework enables to define an optimal matching function between two probability measures with respect to a data-fidelity loss function. The non convexity of the optimization problem renders the choice of this…
We study the semi-discrete formulation of one-dimensional partial optimal transport with quadratic cost, where a probability density is partially transported to a finite sum of Dirac masses of smaller total mass. This problem arises…
In this paper we analyze a mass transportation problem in a bounded domain with the possibility to transport mass to/from the boundary, paying the transport cost, that is given by the Euclidean distance plus an extra cost depending on the…