On the structure of optimal transportation plans between discrete measures
From MaRDI portal
Publication:2674441
Abstract: In this paper, we prove a structure theorem for discrete optimal transportation plans. We show that, given any pair of discrete probability measures and a cost function, there exists an optimal transportation plan that can be expressed as the sum of two deterministic plans. As an application, we estimate the infinity-Wasserstein distance between two discrete probability measures and with the -Wasserstein distance, times a constant depending on , , and the fixed cost function.
Recommendations
- \({\mathcal{W}}_\infty \)-transport with discrete target as a combinatorial matching problem
- Full characterization of optimal transport plans for concave costs
- Discrete optimal transport: complexity, geometry and applications
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
- Optimal measure transportation with respect to non-traditional costs
Cites work
- A characterization of random variables with minimum L^ 2-distance
- A new L^\infty estimate in optimal mass transport
- An inequality for a functional of probability distributions and its application to Kac's one-dimensional model of a Maxwellian gas
- An inequality for certain functional of multidimensional probability distributions
- Asymptotic Properties and Robustness of Minimum Dissimilarity Estimators of Location-scale Parameters
- Caractérisation d'une solution optimale au problème de Monge-Kantorovitch
- Constructing optimal maps for Monge's transport problem as a limit of strictly convex costs
- Existence, Uniqueness, and Regularity of Optimal Transport Maps
- Gradient flows in metric spaces and in the space of probability measures
- Linear Programming
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- On mass transportation
- On minimum Kantorovich distance estimators
- On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
- On the monotonicity of optimal transportation plans
- On the regularity of solutions of optimal transportation problems
- Optimal Transport
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Polar factorization and monotone rearrangement of vector‐valued functions
- Probabilistic treatment of the Boltzmann equation of Maxwellian molecules
- The earth mover's distance as a metric for image retrieval
- The geometry of optimal transportation
- Vlasov equations
Cited in
(10)- Optimal transportation plans and convergence in distribution
- On the geometry of geodesics in discrete optimal transport
- \({\mathcal{W}}_\infty \)-transport with discrete target as a combinatorial matching problem
- 3/4-discrete optimal transport
- Quantitative stability and error estimates for optimal transport plans
- On discontinuity of planar optimal transport maps
- On the computation of the infinity Wasserstein distance and the Wasserstein projection problem
- Normalizing flows as approximations of optimal transport maps via linear-control neural ODEs
- From kinetic theory to AI: a rediscovery of high-dimensional divergences and their properties
- On the Pythagorean Structure of the Optimal Transport for Separable Cost Functions
This page was built for publication: On the structure of optimal transportation plans between discrete measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674441)
