On the optimal map in the 2-dimensional random matching problem

2019/03/28 by Ambrosio, Luigi, Glaudo, Federico, Trevisan, Dario · 2 citations
#35F21 (Secondary) #58J35 #60D05 (Primary) 49J55 #Analysis of PDEs (math.AP) #FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.1903.12153

Abstract

We show that, on a 2-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the L²-norm by identity plus the gradient of the solution to the Poisson problem -Δf^n,t = μ^n,t-1, where μ^n,t is an appropriate regularization of the empirical measure associated to the random points. This shows that the ansatz of Caracciolo et al. (Scaling hypothesis for the Euclidean bipartite matching problem) is strong enough to capture the behavior of the optimal map in addition to the value of the optimal matching cost. As part of our strategy, we prove a new stability result for the optimal transport map on a compact manifold.

Cited by

• A Generalization of Caffarelli's Contraction Theorem to Nearly Spherical Manifolds
• Statistical Inference for Optimal Transport Maps: Recent Advances and Perspectives

Related

• Finer estimates on the 2-dimensional matching problem
• Annealed quantitative estimates for the quadratic 2D-discrete random matching problem
• On the quadratic random matching problem in two-dimensional domains
• Sharp PDE estimates for random two-dimensional bipartite matching with power cost function
• A large-scale regularity theory for the Monge-Ampere equation with rough data and application to the optimal matching problem