On the structure of optimal transportation plans between discrete measures

DOI10.1007/s00245-022-09861-4zbMath1497.49055arXiv2104.13106OpenAlexW3158585035MaRDI QIDQ2674441

Gennaro Auricchio, Marco Veneroni

Publication date: 12 September 2022

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.13106

zbMATH Keywords

uniform estimatesstructure of solutionsWasserstein distancediscrete optimal transportMonge-Kantorovich problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Functional inequalities, including subadditivity, convexity, etc. (39B62) Optimal transportation (49Q22)

Related Items (1)

On the Pythagorean Structure of the Optimal Transport for Separable Cost Functions

Uses Software

• EMD
• Wasserstein GAN

Cites Work

• Unnamed Item
• On the regularity of solutions of optimal transportation problems
• Vlasov equations
• A characterization of random variables with minimum \(L^ 2\)-distance
• The geometry of optimal transportation
• On the monotonicity of optimal transportation plans
• An inequality for certain functional of multidimensional probability distributions
• The earth mover's distance as a metric for image retrieval
• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• On minimum Kantorovich distance estimators
• On mass transportation
• Constructing optimal maps for Monge’s transport problem as a limit of strictly convex costs
• Mathematical Methods of Organizing and Planning Production
• Polar factorization and monotone rearrangement of vector‐valued functions
• An inequality for a functional of probability distributions and its application to Kac's one-dimensional model of a Maxwellian gas
• Probabilistic treatment of the Boltzmann equation of Maxwellian molecules
• Linear Programming
• Caractérisation d'une solution optimale au problème de Monge-Kantorovitch
• On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows
• A new $L^\infty$ estimate in optimal mass transport
• Existence, Uniqueness, and Regularity of Optimal Transport Maps
• Asymptotic Properties and Robustness of Minimum Dissimilarity Estimators of Location-scale Parameters
• Optimal Transport

This page was built for publication: On the structure of optimal transportation plans between discrete measures