一次随机移除g控点
Randomly removing g handles at once
摘要:
Indyk和Sidiropoulos(2007)证明了亏格为$g$的任意可定向图都可以概率嵌入亏格为$g-1$的图中,且该亏格具有常数失真.将亏格$g$的图看作嵌入到附着有$g$句柄的球体表面上,Indyk和Sidiropoulos的方法通过迭代地移除句柄,给出了嵌入到具有失真$2^{O(g)}$的平面图上的分布中。通过一次删除所有的$g$句柄,我们提出了一个概率嵌入失真$O(g^2)$可定向和不可定向图。我们的结果是通过证明Erickson和Har Peled(2004)的numumum-cut图具有低膨胀,然后使用Lee和Sidiropoulos(2009)的Peeling引理随机地将该图从表面切割出来而获得的。
英文摘要:
Indyk and Sidiropoulos (2007) proved that any orientable graph of genus $g$ can be probabilistically embedded into a graph of genus $g-1$ with constant distortion. Viewing a graph of genus $g$ as embedded on the surface of a sphere with $g$ handles attached, Indyk and Sidiropoulos' method gives an embedding into a distribution over planar graphs with distortion $2^{O(g)}$, by iteratively removing the handles. By removing all $g$ handles at once, we present a probabilistic embedding with distortion $O(g^2)$ for both orientable and non-orientable graphs. Our result is obtained by showing that the nimum-cut graph of Erickson and Har Peled (2004) has low dilation, and then randomly cutting this graph out of the surface using the Peeling Lemma of Lee and Sidiropoulos (2009).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。