Decomposition of the Kantorovich problem and Wasserstein distances on simplexes
Danila Zaev

TL;DR
This paper shows that the Kantorovich metric on the set of T-invariant measures can be reconstructed from extreme points, and invariant optimal plans are mixtures of plans between these extreme points, with generalizations to constrained cases.
Contribution
It establishes a decomposition of the Kantorovich problem on invariant measure simplexes, linking the metric to extreme points and extending to constrained and ergodic decomposable simplexes.
Findings
Kantorovich metric can be reconstructed from extreme points.
Invariant optimal plans are mixtures of plans between extreme points.
Results extend to constrained Kantorovich problems and ergodic decomposable simplexes.
Abstract
Let be a Polish space, be the set of Borel probability measures on , and be a homeomorphism. We prove that for the simplex of all -invariant measures, the Kantorovich metric on can be reconstructed from its values on the set of extreme points. This fact is closely related to the following result: the invariant optimal transportation plan is a mixture of invariant optimal transportation plans between extreme points of the simplex. The latter result can be generalized to the case of the Kantorovich problem with additional linear constraints and the class of ergodic decomposable simplexes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Point processes and geometric inequalities · Geometry and complex manifolds
