Scaling limits of discrete optimal transport

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