L_1中有限树的降维
Dimension reduction for finite trees in L_1
摘要:
我们证明了对于每个eps > 0,每个n-点树度量允许一个(1+eps)-嵌入到C(eps)log n-维L_1空间中,其中C(eps)= O((1/eps)^4 log(1/eps)).这与自然体积下界匹配,直到仅取决于eps的因子。在此之前,我们并不知道即使是在n个节点上的完整二叉树是否也可以嵌入到O(log n)维中,且失真为O(1)。对于完全d叉树,我们的构造实现了C(eps)= O(1/eps^2)。
英文摘要:
We show that every n-point tree metric admits a (1+eps)-embedding into a C(eps) log n-dimensional L_1 space, for every eps > 0, where C(eps) = O((1/eps)^4 log(1/eps)). This matches the natural volume lower bound up to a factor depending only on eps. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in O(log n) dimensions with O(1) distortion. For complete d-ary trees, our construction achieves C(eps) = O(1/eps^2).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。