Scaling limits of discrete optimal transport

2018/09/04 by Gladbach, Peter, Kopfer, Eva, Maas, Jan · 3 citations
#Analysis of PDEs (math.AP) #FOS: Mathematics #Metric Geometry (math.MG) #Numerical Analysis (math.NA) #Optimization and Control (math.OC) #Probability (math.PR)

paper · doi:10.48550/arxiv.1809.01092

Abstract

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 \mathbbW₂, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric W_T in terms of \mathbbW₂, 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.

Cited by

• Homogenization of Time-Discrete Gradient Flows
• A Primal-dual Forward-backward Splitting Method for Cross-diffusion Gradient Flows with General Mobility Matrices
• Information geometry of perturbed gradient flow systems on hypergraphs: A perspective towards nonequilibrium physics

Related

• Homogenisation of one-dimensional discrete optimal transport
• Gromov-Hausdorff convergence of discrete transportation metrics
• On the convergence of discrete dynamic unbalanced transport models
• Optimal Transport on Discrete Domains
• Tensor optimal transport, distance between sets of measures and tensor scaling