民间采样对精确跳集是最优的:确认 $\sqrt{n}$ 障碍
Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
AI总结:
本文证明民间采样对精确跳集是最优的,构造了图使得任何$O(n)$边精确跳集直径下界为$\widetildeΩ(n^{1/2})$,并改进捷径集下界至$\widetildeΩ(n^{1/4})$,确认了$\sqrt{n}$障碍。
摘要:
对于图 $G$,一个 $D$-直径缩减的精确跳集是一小集额外边 $H$,当添加到 $G$ 时,保持其图度量,但保证所有节点对在 $G \cup H$ 中有一条使用至多 $D$ 条边的最短路径。捷径集是可达性的类似概念。这些对象自90年代初以来就被研究,因为它们在并行、分布式、动态和流式图算法中有应用。\n 在其大部分历史中,任一对象的先进构造都是简单的民间算法,基于随机采样节点以命中图中的长路径。然而,Kogan和Parter [SODA '22] 以及 Bernstein和Wein [SODA '23] 的近期突破最终改进了捷径集和 $(1+ε)$-近似跳集的民间直径界 $\widetilde{O}(n^{1/2})$。对于这两个对象,现在已知可以使用 $O(n)$ 条跳边将直径缩减到 $\widetilde{O}(n^{1/3})$。民间采样唯一未被改进的设置是精确跳集。这些改进能否继续?\n 我们通过构造图来否定性地解决这个问题,在这些图上,任何 $O(n)$ 条边的精确跳集都有直径 $\widetildeΩ(n^{1/2})$。这改进了Kogan和Parter [FOCS '22] 的先前下界 $\widetildeΩ(n^{1/3})$。使用类似的想法,我们还多项式地改进了捷径集的当前下界,构造图,在这些图上任何 $O(n)$ 条边的捷径集将直径缩减到 $\widetildeΩ(n^{1/4})$。这改进了Huang和Pettie [SIAM J. Disc. Math. '18] 的先前下界 $Ω(n^{1/6})$。我们还扩展了我们的构造,为其他 $p$ 值提供针对 $O(p)$-大小精确跳集和捷径集的下界;特别是,我们表明民间采样在 $p \in [1, n^2]$ 的整个范围内对精确跳集是接近最优的。
英文摘要:
For a graph $G$, a $D$-diameter-reducing exact hopset is a small set of additional edges $H$ that, when added to $G$, maintains its graph metric but guarantees that all node pairs have a shortest path in $G \cup H$ using at most $D$ edges. A shortcut set is the analogous concept for reachability. These objects have been studied since the early '90s due to applications in parallel, distributed, dynamic, and streaming graph algorithms. For most of their history, the state-of-the-art construction for either object was a simple folklore algorithm, based on randomly sampling nodes to hit long paths in the graph. However, recent breakthroughs of Kogan and Parter [SODA '22] and Bernstein and Wein [SODA '23] have finally improved over the folklore diameter bound of $\widetilde{O}(n^{1/2})$ for shortcut sets and for $(1+ε)$-approximate hopsets. For both objects it is now known that one can use $O(n)$ hop-edges to reduce diameter to $\widetilde{O}(n^{1/3})$. The only setting where folklore sampling remains unimproved is for exact hopsets. Can these improvements be continued? We settle this question negatively by constructing graphs on which any exact hopset of $O(n)$ edges has diameter $\widetildeΩ(n^{1/2})$. This improves on the previous lower bound of $\widetildeΩ(n^{1/3})$ by Kogan and Parter [FOCS '22]. Using similar ideas, we also polynomially improve the current lower bounds for shortcut sets, constructing graphs on which any shortcut set of $O(n)$ edges reduces diameter to $\widetildeΩ(n^{1/4})$. This improves on the previous lower bound of $Ω(n^{1/6})$ by Huang and Pettie [SIAM J. Disc. Math. '18]. We also extend our constructions to provide lower bounds against $O(p)$-size exact hopsets and shortcut sets for other values of $p$; in particular, we show that folklore sampling is near-optimal for exact hopsets in the entire range of $p \in [1, n^2]$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。