arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2003.09895cs.DCcs.DS
收藏

分布式图生成器的局部信息成本

The Local Information Cost of Distributed Graph Spanners

Peter Robinson

AI总结:

本文提出局部信息成本 LIC,为 CONGEST KT1 模型建立通信—时间权衡下界,并据此改进稀疏乘法拉伸图生成器的通信复杂度下界。

摘要:

我们引入了局部信息成本(LIC),它量化了网络中的节点在求解图问题时需要学习的信息量。我们证明,局部信息成本为分布式算法的通信复杂度提供了一个自然的下界。对于同步 CONGEST KT1 模型(其中每个节点初始知道其邻居的 ID),我们证明,要用一个 τ 轮算法求解图问题 P,且算法出错概率至多为 γ,需要 Ω(LIC_γ(P)/(log τ log n)) 比特。我们的结果是首个在 CONGEST KT1 模型中为图问题给出通信与时间之间一般权衡关系的下界。我们通过推导计算一个乘法拉伸为 2t−1、边数至多为 O(n^{1+1/t+ε})(其中 ε=O(1/t^2))的生成器的通信复杂度下界,展示了如何应用局部信息成本。更具体地说,我们证明,任何 O(poly(n)) 时间的生成器算法都必须发送至少 tilde Ω((1/t^2)n^{1+1/(2t)}) 比特。此前,该问题仅已知一个平凡的 tilde Ω(n) 比特下界。(完整摘要见 PDF。)

英文摘要:

We introduce the \emph{local information cost} (LIC), which quantifies the amount of information that nodes in a network need to learn when solving a graph problem. We show that the local information cost presents a natural lower bound on the communication complexity of distributed algorithms. For the synchronous CONGEST KT1 model, where each node has initial knowledge of its neighbors' IDs, we prove that $Ω(\frac{\text{LIC}_γ(P)}{\logτ\log n})$ bits are required for solving a graph problem $P$ with a $τ$-round algorithm that errs with probability at most $γ$. Our result is the first lower bound that yields a general trade-off between communication and time for graph problems in the CONGEST KT1 model. We demonstrate how to apply the local information cost by deriving a lower bound on the communication complexity of computing a spanner with multiplicative stretch $2t-1$ that consists of at most $O(n^{1+\frac{1}{t} + ε})$ edges, where $ε= O( {1}/{t^2} )$. More concretely, we show that any $O(\text{poly}(n))$-time spanner algorithm must send at least $\tildeΩ(\tfrac{1}{t^2} n^{1+{1}/{2t}})$ bits. Previously, only a trivial lower bound of $\tilde Ω(n)$ bits was known for this problem. (See PDF for the full abstract.)

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

↑