Scaling limits of discrete optimal transport

P. Gladbach, E. Kopfer, J. Maas, (n.d.).

Preprint | Submitted | English
Gladbach, Peter; Kopfer, Eva; Maas, JanIST Austria
We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in ℝd. These metrics are natural discrete counterparts to the Kantorovich metric π•Ž2, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric Wt in terms of π•Ž2, as the size of the mesh T tends to 0. However, we show that the corresponding lower bound may fail in general, even on certain one-dimensional and symmetric two-dimensional meshes. In addition, we show that the asymptotic lower bound holds under an isotropy assumption on the mesh, which turns out to be essentially necessary. This assumption is satisfied, e.g., for tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence of the transport metric.
Publishing Year
Date Published

Cite this

Gladbach P, Kopfer E, Maas J. Scaling limits of discrete optimal transport.
Gladbach, P., Kopfer, E., & Maas, J. (n.d.). Scaling limits of discrete optimal transport. ArXiv.
Gladbach, Peter, Eva Kopfer, and Jan Maas. β€œScaling Limits of Discrete Optimal Transport.” ArXiv, n.d.
P. Gladbach, E. Kopfer, and J. Maas, β€œScaling limits of discrete optimal transport.” ArXiv.
Gladbach P, Kopfer E, Maas J. Scaling limits of discrete optimal transport.
Gladbach, Peter, et al. Scaling Limits of Discrete Optimal Transport. ArXiv.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]

Link(s) to Main File(s)
Access Level
OA Open Access


Marked Publications

Open Data IST Research Explorer


arXiv 1809.01092

Search this title in

Google Scholar