English
Related papers

Related papers: On semi-discrete Monge problem and generalized opt…

200 papers

We present an optimal mass transport framework on the space of Gaussian mixture models, which are widely used in statistical inference. Our method leads to a natural way to compare, interpolate and average Gaussian mixture models.…

Probability · Mathematics 2018-02-01 Yongxin Chen , Tryphon T. Georgiou , Allen Tannenbaum

In this paper we extend recent developments in computational optimal transport to the setting of Riemannian manifolds. In particular, we show how to learn optimal transport maps from samples that relate probability distributions defined on…

In this paper, we consider the Monge optimal transport problem with distance cost. We prove that in some metric spaces, possibly with many branching geodesics, an optimal transport map exists if the first marginal is absolutely continuous.…

Metric Geometry · Mathematics 2019-10-01 Shinichiro Kobayashi

We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X,dN) a possibly branching geodesic space. We show that under some assumptions on the…

Probability · Mathematics 2012-10-01 Fabio Cavalletti

Let $n > m\ge 2$ be integers and let $\mathcal{A}=\{A_1,\dots,A_m\}$ be a partition of $[n]=\{1,\dots,n\}$. For $X \subseteq [n]$, its $\mathcal{A}$-boundary region $\mathcal{A}(X)$ is defined to be the union of those blocks $A_i$ of…

Combinatorics · Mathematics 2019-06-21 Konrad Engel , Tran Dan Thu

This paper investigates the optimal transport problem within the framework of Linear Quadratic optimal control systems. We establish the well-posedness of the Monge problem and analyze the regularity of the resulting optimal transport map,…

Optimization and Control · Mathematics 2026-05-25 Luca Rizzi , Alec Jacopo Almo Schiavoni Piazza

In this paper, we propose to study the following maximum ordinal consensus problem: Suppose we are given a metric system (M, X), which contains k metrics M = {\rho_1,..., \rho_k} defined on the same point set X. We aim to find a maximum…

Computational Complexity · Computer Science 2021-03-03 Dingkang Wang , Yusu Wang

The aim of this paper is to prove isoperimetric inequalities on submanifolds of the Euclidean space using mass transportation methods. We obtain a sharp ?weighted isoperimetric inequality? and a nonsharp classical inequality similar to the…

Differential Geometry · Mathematics 2016-11-25 Philippe Castillon

We show that, on a $2$-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the $L^2$-norm by identity plus the gradient of the solution to the Poisson problem $-\Delta…

Probability · Mathematics 2019-03-29 Luigi Ambrosio , Federico Glaudo , Dario Trevisan

Let (X,L) be a (semi-) polarized complex projective variety and T a real torus acting holomorphically on X with moment polytope P. Given a probability density g on P we introduce a new type of Monge-Ampere measure on X, defined for singular…

Differential Geometry · Mathematics 2014-02-03 Robert J. Berman , David Witt Nystrom

We present generalized versions of Monge's and Kantorovich's optimal transport problems with the probabilities being transported replaced by lower probabilities. We show that, when the lower probabilities are the lower envelopes of…

Machine Learning · Statistics 2025-04-21 Michele Caprio

We investigate the transportation problem under a Monge cost structure and derive compact formulas for optimal dual solutions based on the northwest-corner rule. As an application illustrating how these formulas yield structural insight…

Optimization and Control · Mathematics 2026-02-23 Stefan Nickel , Justo Puerto , Simon Ramoser , Alberto Torrejon

The multistsochastic Monge--Kantorovich problem on the product $X = \prod_{i=1}^n X_i$ of $n$ spaces is a generalization of the multimarginal Monge--Kantorovich problem. For a given integer number $1 \le k<n$ we consider the minimization…

Functional Analysis · Mathematics 2020-08-19 Nikita A. Gladkov , Alexander V. Kolesnikov , Alexander P. Zimin

A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…

Combinatorics · Mathematics 2007-06-12 Geir Agnarsson

A result of Hohloch links the theory of integer partitions with the Monge formulation of the optimal transport problem, giving the optimal transport map between (Young diagrams of) integer partitions and their corresponding symmetric…

Combinatorics · Mathematics 2023-10-17 Daniel Owusu Adu , Daniel Keliher

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…

Optimization and Control · Mathematics 2026-05-05 Alessandro Pinzi

These notes constitute a sort of Crash Course in Optimal Transport Theory. The different features of the problem of Monge-Kantorovitch are treated, starting from convex duality issues. The main properties of space of probability measures…

Classical Analysis and ODEs · Mathematics 2010-09-21 Filippo Santambrogio

In this paper, we discuss a class of spectral partition problems with a measure constraint, for partitions of a given bounded connected open set. We establish the existence of an optimal open partition, showing that the corresponding…

Analysis of PDEs · Mathematics 2023-06-22 Pêdra D. S. Andrade , Ederson Moreira dos Santos , Makson S. Santos , Hugo Tavares

We consider the optimal transport problem over convex costs arising from optimal control of linear time-invariant(LTI) systems when the initial and target measures are assumed to be supported on the set of equilibrium points of the LTI…

Optimization and Control · Mathematics 2023-12-19 Karthik Elamvazhuthi , Matt Jacobs

This paper focuses on a similarity measure, known as the Wasserstein distance, with which to compare images. The Wasserstein distance results from a partial differential equation (PDE) formulation of Monge's optimal transport problem. We…

Computer Vision and Pattern Recognition · Computer Science 2018-04-10 Michael Snow , Jan Van lent