Gromov-Hausdorff convergence of discrete transportation metrics
Nicola Gigli, Jan Maas

TL;DR
This paper proves that discrete transportation metrics on a d-dimensional discrete torus converge to the continuous 2-Wasserstein distance on the torus as the mesh size decreases, establishing a key link between discrete and continuous optimal transport.
Contribution
It provides the first convergence proof of discrete transportation metrics to the classical Wasserstein distance, bridging discrete and continuous optimal transport frameworks.
Findings
Discrete transportation metrics converge to W_2 as mesh size decreases
First convergence result for these discrete metrics
Shows compatibility between discrete and continuous transport metrics
Abstract
This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N converge, when , to the standard 2-Wasserstein distance W_2 on the continuous torus in the sense of Gromov-Hausdorff. This is the first convergence result for the recently developed discrete transportation metrics. The result shows the compatibility between these metrics and the well-established 2-Wasserstein metric.
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
