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

分布对称破缺的局部性

The Locality of Distributed Symmetry Breaking

Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider

摘要:

对称破缺问题是分布式计算领域中研究得最多的问题之一,但关于其复杂性的最基本问题仍然是开放的。在本文中,我们的工作在网络模型(输入图和底层的分布式网络是相同的)和研究的随机复杂性的四个基本对称破缺问题的图:计算MIS(最大独立集),最大匹配,顶点着色,和规则集。我们的结果的一个小样本包括-MIS算法运行在$O(\log^2Δ+ 2^{O(\sqrt{\log\log n})})$的时间,其中$Δ$是最大程度。这是第一个MIS算法,以改善1986年的算法Luby和Alon,Babai,和Itai,当$\log n \ll Δ\ll 2^{\sqrt{\log n}}$,并接近$Ω(\log Δ)$下界的库恩,Mosicbroda,和Wattenhofer。- 在$O(\logΔ+ \log^4\log n)$时间内运行的最大匹配算法。这是对1986年Israeli和Itai算法的第一次重大改进。此外,它对$Δ$的依赖性可证明是最优的。- 将低荫度/退化图中的对称破缺问题降为低度图的一种方法。(粗略地说,图的荫度或退化度限制了任何子图的密度。这种减少的推论包括一个$O(\sqrt{\log n})$ -时间最大匹配算法的图形荫度高达$2^{\sqrt{\log n}}$和一个$O(\log^{2/3} n)$ -时间MIS算法的图形荫度高达$2^{(\log n)^{1/3}}$。我们的每一个算法是基于一个简单的,但功能强大的技术,减少一个随机的对称性破缺任务,一个相应的确定性的聚$(\log n)$大小的图。

英文摘要:

Symmetry breaking problems are among the most well studied in the field of distributed computing and yet the most fundamental questions about their complexity remain open. In this paper we work in the LOCAL model (where the input graph and underlying distributed network are identical) and study the randomized complexity of four fundamental symmetry breaking problems on graphs: computing MISs (maximal independent sets), maximal matchings, vertex colorings, and ruling sets. A small sample of our results includes - An MIS algorithm running in $O(\log^2Δ+ 2^{O(\sqrt{\log\log n})})$ time, where $Δ$ is the maximum degree. This is the first MIS algorithm to improve on the 1986 algorithms of Luby and Alon, Babai, and Itai, when $\log n \ll Δ\ll 2^{\sqrt{\log n}}$, and comes close to the $Ω(\log Δ)$ lower bound of Kuhn, Moscibroda, and Wattenhofer. - A maximal matching algorithm running in $O(\logΔ+ \log^4\log n)$ time. This is the first significant improvement to the 1986 algorithm of Israeli and Itai. Moreover, its dependence on $Δ$ is provably optimal. - A method for reducing symmetry breaking problems in low arboricity/degeneracy graphs to low degree graphs. (Roughly speaking, the arboricity or degeneracy of a graph bounds the density of any subgraph.) Corollaries of this reduction include an $O(\sqrt{\log n})$-time maximal matching algorithm for graphs with arboricity up to $2^{\sqrt{\log n}}$ and an $O(\log^{2/3} n)$-time MIS algorithm for graphs with arboricity up to $2^{(\log n)^{1/3}}$. Each of our algorithms is based on a simple, but powerful technique for reducing a randomized symmetry breaking task to a corresponding deterministic one on a poly$(\log n)$-size graph.

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

↑