arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.16701cs.DS
收藏

关于展开子分解的流式复杂度

On the Streaming Complexity of Expander Decomposition

Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali

AI总结:

本文研究流式模型下展开子分解的空间复杂度,提出首个计算边界链接展开子分解的流式算法,以$\tilde{O}(n)$空间实现任意$φ$的分解,并证明计算分解序列需${\tildeΩ}(n/φ)$空间下界。

摘要:

本文研究了在流式模型下寻找图的$(ε, φ)$-展开子分解的问题,特别是针对边插入和删除的动态流。目标是划分顶点集,使得每个连通分量诱导出一个$φ$-展开子,同时簇间边的数量仅占总容量的$ε$比例。最近有研究表明,存在一个简单算法,可以使用$\tilde{O}(n/φ^2)$比特的空间,为$n$个顶点的图构造$(O(φ\log n), φ)$-展开子分解[Filtser, Kapralov, Makarov, ITCS'23]。这一结果促使我们理解空间对稀疏参数$φ$的依赖在多大程度上是固有的。我们从两个方面着手回答这个问题。我们证明,对于任意$φ$,可以使用$\tilde{O}(n)$空间找到$(O(φ\log n), φ)$-展开子分解。我们结果的核心是第一个用于计算边界链接展开子分解的流式算法,这是最近引入的经典概念的强化版本[Goranci et al., SODA'21]。关键优势在于,一个经典的稀疏化器[Fung et al., STOC'11],其大小与$φ$无关,在乘法误差内保持边界链接展开子分解的簇内切割。值得注意的算法应用使用展开子分解序列,特别是人们经常重复计算由簇间边诱导的子图的分解(例如,Spielman和Teng关于谱稀疏化的开创性工作[Spielman, Teng, SIAM Journal of Computing 40(4)],或最近的最大流突破[Chen et al., FOCS'22]等)。我们证明,任何计算$(O(φ\log n), φ)$-展开子分解序列的流式算法需要${\tildeΩ}(n/φ)$比特的空间,即使在仅插入流中也是如此。

英文摘要:

In this paper we study the problem of finding $(ε, ϕ)$-expander decompositions of a graph in the streaming model, in particular for dynamic streams of edge insertions and deletions. The goal is to partition the vertex set so that every component induces a $ϕ$-expander, while the number of inter-cluster edges is only an $ε$ fraction of the total volume. It was recently shown that there exists a simple algorithm to construct a $(O(ϕ\log n), ϕ)$-expander decomposition of an $n$-vertex graph using $\widetilde{O}(n/ϕ^2)$ bits of space [Filtser, Kapralov, Makarov, ITCS'23]. This result calls for understanding the extent to which a dependence in space on the sparsity parameter $ϕ$ is inherent. We move towards answering this question on two fronts. We prove that a $(O(ϕ\log n), ϕ)$-expander decomposition can be found using $\widetilde{O}(n)$ space, for every $ϕ$. At the core of our result is the first streaming algorithm for computing boundary-linked expander decompositions, a recently introduced strengthening of the classical notion [Goranci et al., SODA'21]. The key advantage is that a classical sparsifier [Fung et al., STOC'11], with size independent of $ϕ$, preserves the cuts inside the clusters of a boundary-linked expander decomposition within a multiplicative error. Notable algorithmic applications use sequences of expander decompositions, in particular one often repeatedly computes a decomposition of the subgraph induced by the inter-cluster edges (e.g., the seminal work of Spielman and Teng on spectral sparsifiers [Spielman, Teng, SIAM Journal of Computing 40(4)], or the recent maximum flow breakthrough [Chen et al., FOCS'22], among others). We prove that any streaming algorithm that computes a sequence of $(O(ϕ\log n), ϕ)$-expander decompositions requires ${\widetildeΩ}(n/ϕ)$ bits of space, even in insertion only streams.

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

↑