arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.14852math.FAcs.CGmath.COmath.MG
收藏

$L_1$-距离的下界:运输成本空间

Lower Estimates for $L_1$-Distortion of Transportation Cost Spaces

University of North Carolina at Charlotte(北卡罗来纳大学夏洛特分校);St. John’s University(圣约翰大学)

Chris Gartland, Mikhail Ostrovskii

AI总结:

研究了平面网格的$L_1$-扭曲下界,证明其为$Ω(\log n)$,并提出新的索伯列夫型不等式作为关键工具。

摘要:

对有限度量空间上两个概率分布之间的差异程度进行量化是计算机科学和计算机视觉中的基本任务。基于最优运输的自然差异度量是地球移动距离(EMD)。分析此度量的关键技术,由Charikar(2002)和Indyk和Thaper(2003)率先提出,涉及将EMD(X)嵌入到勒贝格空间$L_1$中的低扭曲嵌入。在计算机视觉中,网格图,特别是平面网格,是最基本的。Indyk提出了关于均匀分布在$R^2$中n点子集空间的$L_1$-扭曲估计问题。进展报告,最后一次更新于2011年8月,突出了两个关键结果:第一,Khot和Naor(2006)关于汉明立方体的工作,证明了汉明立方体的$L_1$-扭曲满足上述上界;第二,Naor和Schechtman(2007)对于平面网格的结果,证明了平面n乘n网格的$L_1$-扭曲为$Ω(\sqrt{\log n})$。我们的第一个结果是将网格的$L_1$-扭曲下界提升到$Ω(\log n)$,与通用上界相匹配,仅相差常数因子。使我们能够获得这些精确估计的关键成分是新的关于网格图上标量函数的索伯列夫型不等式。我们的方法也适用于许多递归图族,如钻石图和Laakso图。我们在这些情况下也获得了精确的扭曲估计$\log n$。

英文摘要:

Quantifying the degree of dissimilarity between two probability distributions on a finite metric space is a fundamental task in Computer Science and Computer Vision. A natural dissimilarity measure based on optimal transport is the Earth Mover's Distance (EMD). A key technique for analyzing this metric, pioneered by Charikar (2002) and Indyk and Thaper (2003), involves constructing low-distortion embeddings of EMD(X) into the Lebesgue space $L_1$. It became a key problem to investigate whether the upper bound of $O(\log n)$ can be improved for important classes of metric spaces known to admit low-distortion embeddings into $L_1$. In the context of Computer Vision, grid graphs, especially planar grids, are among the most fundamental. Indyk posed the related problem of estimating the $L_1$-distortion of the space of uniform distributions on $n$-point subsets of $R^2$. The Progress Report, last updated in August 2011, highlighted two key results: first, the work of Khot and Naor (2006) on Hamming cubes, which showed that the $L_1$-distortion for Hamming cubes meets the described above upper estimate, and second, the result of Naor and Schechtman (2007) for planar grids, which established that the $L_1$-distortion of for a planar $n$ by $n$ grid is $Ω(\sqrt{\log n})$. Our first result is the improvement of the lower bound on the $L_1$-distortion for grids to $Ω(\log n)$, matching the universal upper bound up to multiplicative constants. The key ingredient allowing us to obtain these sharp estimates is a new Sobolev-type inequality for scalar-valued functions on the grid graphs. Our method is also applicable to many recursive families of graphs, such as diamond and Laakso graphs. We obtain the sharp distortion estimates of $\log n$ in these cases as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑