$L_1$-distortion of Earth Mover Distances and Transportation Cost Spaces on High Dimensional Grids

📅 2026-02-22
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This study addresses the problem of minimizing distortion when embedding the Earth Mover Distance (EMD) over high-dimensional grids into ℓ₁ space. By constructing random measures supported on bipartite cubes and leveraging tools from harmonic analysis, metric embedding theory, and dyadic decomposition, the authors establish a new Sobolev-type inequality tailored to high-dimensional grids. This inequality leads to the first proof that the distortion of any embedding of EMD into ℓ₁ is lower-bounded by Ω(log N), where the implicit constant is independent of the dimension. This lower bound matches the universal upper bound of O(log N) for embeddings of arbitrary N-point metric spaces into ℓ₁, thereby fully characterizing the tight asymptotic bounds for this fundamental embedding problem.

Technology Category

Application Category

📝 Abstract
We prove that the distortion of any embedding into $L_1$ of the transportation cost space or earth mover distance over a $d$-dimensional grid $\{1,\dots m\}^d$ is $Ω(\log N)$, where $N$ is the number of vertices and the implicit constant is universal (in particular, independent of dimension). This lower bound matches the universal upper bound $O(\log N)$ holding for any $N$-point metric space. Our proof relies on a new Sobolev inequality for real-valued functions on the grid, based on random measures supported on dyadic cubes.
Problem

Research questions and friction points this paper is trying to address.

L1-distortion
Earth Mover Distance
Transportation Cost Space
High Dimensional Grids
Metric Embedding
Innovation

Methods, ideas, or system contributions that make the work stand out.

Earth Mover Distance
L1 embedding
transportation cost space
Sobolev inequality
distortion lower bound
🔎 Similar Papers
No similar papers found.
C
Chris Gartland
M
Mikhail Ostrovskii
Yuval Rabani
Yuval Rabani
The Hebrew University of Jerusalem
Theory of Computation
R
Robert Young