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

通用覆盖、颜色细化和双变量计数逻辑:深度的下限

Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth

Andreas Krebs, Oleg Verbitsky

摘要:

给定一个连通图$G$及其顶点$x$,用$U_x(G)$表示从$x$出发将$G$展开为树所得到的$G$的泛覆盖.令$T=T(n)$是最小数,使得对于每个都具有至多$n$顶点的图$G$和$H$,$U_x(G)$和$U_y(H)$的同构必然从在深度$T$处截断的这些根树的同构得出。受分布式计算理论中应用的启发,Norris [Discrete Appl. Math. 1995]问,如果$T(n)\le n$。我们通过建立$T(n)=(2-o(1))n$来否定地回答这个问题。我们的解决方案使用有限模型理论的基本工具,如Immerman-Lander 2-pebble计数游戏的互模拟版本。为了证明$T(n)$的下界,我们构造了图$G_n$和$H_n$,图$G_n$和$H_n$也给出了其它一些紧下界。$G_n$和$H_n$都有$n$顶点,在2变量计数逻辑中只能用量词深度$(1-o(1))n$区分。由此可见,颜色细化(用于同构测试和用于计算图的粗略公平划分的其他领域的经典过程)需要$(1-o(1))n$轮来在$G_n$和$H_n$中的每一个上实现颜色稳定。有些令人惊讶的是,该轮数不足以在$G_n$和$H_n$的不相交联合上稳定颜色,其中需要$(2-o(1))n$轮。

英文摘要:

Given a connected graph $G$ and its vertex $x$, let $U_x(G)$ denote the universal cover of $G$ obtained by unfolding $G$ into a tree starting from $x$. Let $T=T(n)$ be the minimum number such that, for graphs $G$ and $H$ with at most $n$ vertices each, the isomorphism of $U_x(G)$ and $U_y(H)$ surely follows from the isomorphism of these rooted trees truncated at depth $T$. Motivated by applications in theory of distributed computing, Norris [Discrete Appl. Math. 1995] asks if $T(n)\le n$. We answer this question in the negative by establishing that $T(n)=(2-o(1))n$. Our solution uses basic tools of finite model theory such as a bisimulation version of the Immerman-Lander 2-pebble counting game. The graphs $G_n$ and $H_n$ we construct to prove the lower bound for $T(n)$ also show some other tight lower bounds. Both having $n$ vertices, $G_n$ and $H_n$ can be distinguished in 2-variable counting logic only with quantifier depth $(1-o(1))n$. It follows that color refinement, the classical procedure used in isomorphism testing and other areas for computing the coarsest equitable partition of a graph, needs $(1-o(1))n$ rounds to achieve color stabilization on each of $G_n$ and $H_n$. Somewhat surprisingly, this number of rounds is not enough for color stabilization on the disjoint union of $G_n$ and $H_n$, where $(2-o(1))n$ rounds are needed.

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

↑