Preprint
Inserted: 20 nov 2026
Last Updated: 20 nov 2026
Year: 2026
Abstract:
We consider the random bipartite matching problem between two independent families of uniformly distributed points in dimension three and higher, for the cost given by the $p$-th power of the distance. We show that, up to logarithmic factors, every moment of the displacement of the optimal matching is of the order of the typical interparticle distance. This is a higher integrability, or Calderon--Zygmund type, estimate for optimal transport, and it settles, on the torus and up to logarithmic factors, a recent conjecture of D'Achille, Mattesini and the third author. As a consequence, we obtain concentration of the matching cost around its mean for every $p\ge2$. The proof combines a deterministic large-scale regularity theory for optimal transport with $p$-costs, based on a harmonic approximation by a non-linear elliptic equation of $p$-Laplacian type, with tail bounds on local matching costs.