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

补全树上局部可检查标记问题的节点平均复杂度图景

Completing the Node-Averaged Complexity Landscape of LCLs on Trees

Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid

AI总结:

本文完整刻画了有界度树上LCL问题的节点平均复杂度图景,证明其不存在介于ω(1)与(log*n)^{o(1)}之间的复杂度,并构造出覆盖特定(log*n)^c区间及n^x区间的问题实例。

摘要:

一个问题的节点平均复杂度刻画了在LOCAL模型中图的节点平均需要花费多少轮才能解决该问题。围绕这一新复杂度度量,一条具有挑战性的研究主线是理解有界度图族上局部可检查标记(LCL)问题的复杂度图景。在此背景下特别有趣的是有界度树族,因为对于最坏情况复杂度,我们已经知道LCL问题可能复杂度和结构的完整刻画。节点平均复杂度情形的第一步最近已在[DISC '23]中完成,其中作者特别证明了在有界度树上存在一个很大的复杂度间隙:不存在确定性节点平均复杂度介于$ω(\log^* n)$和$n^{o(1)}$之间的LCL问题。对于随机化算法,他们甚至证明了节点平均复杂度要么是$O(1)$,要么是$n^{Ω(1)}$。在本文中,我们填补了剩余的空白,并给出了有界度树上LCL问题节点平均复杂度图景的完整描述。我们的贡献有三个方面。\n- 在有界度树上,不存在节点平均复杂度介于$ω(1)$和$(\log^*n)^{o(1)}$之间的LCL问题。\n- 对于任意常数$0<r_1 < r_2 \leq 1$和$\varepsilon>0$,存在一个常数$c$和一个节点平均复杂度介于$Ω((\log^* n)^c)$和$O((\log^* n)^{c+\varepsilon})$之间的LCL问题。\n- 对于任意常数$0<α\leq 1/2$和$\varepsilon>0$,存在一个节点平均复杂度为$Θ(n^x)$的LCL问题,其中$x\in [α, α+\varepsilon]$。

英文摘要:

The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to understand the complexity landscape of locally checkable labelings (LCLs) on families of bounded-degree graphs. Particularly interesting in this context is the family of bounded-degree trees as there, for the worst-case complexity, we know a complete characterization of the possible complexities and structures of LCL problems. A first step for the node-averaged complexity case has been achieved recently [DISC '23], where the authors in particular showed that in bounded-degree trees, there is a large complexity gap: There are no LCL problems with a deterministic node-averaged complexity between $ω(\log^* n)$ and $n^{o(1)}$. For randomized algorithms, they even showed that the node-averaged complexity is either $O(1)$ or $n^{Ω(1)}$. In this work we fill in the remaining gaps and give a complete description of the node-averaged complexity landscape of LCLs on bounded-degree trees. Our contributions are threefold. - On bounded-degree trees, there is no LCL with a node-averaged complexity between $ω(1)$ and $(\log^*n)^{o(1)}$. - For any constants $0<r_1 < r_2 \leq 1$ and $\varepsilon>0$, there exists a constant $c$ and an LCL problem with node-averaged complexity between $Ω((\log^* n)^c)$ and $O((\log^* n)^{c+\varepsilon})$. - For any constants $0<α\leq 1/2$ and $\varepsilon>0$, there exists an LCL problem with node-averaged complexity $Θ(n^x)$ for some $x\in [α, α+\varepsilon]$.

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

↑