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

Weisfeiler-Lehman算法的组合能力

On the Combinatorial Power of the Weisfeiler-Lehman Algorithm

Martin Fürer

摘要:

经典的Weisfeiler-Lehman方法WL [2]使用边缘颜色来产生强大的图不变量。它至少在区分非同构图的能力上与最突出的代数图不变量一样强大。它不仅决定了图的谱、标准基向量与特征空间之间的夹角,而且还决定了标准基向量在特征空间中的投影之间的夹角。在这里,我们研究WL [2]的组合能力。对于足够大的k,WL [k]决定了图的所有组合性质。对于小k,许多传统上使用的组合不变量由WL [k]确定。我们着重于两个基本不变量,长度为p的圈数Cp和大小为p的团数Kp。我们证明WL [2]决定长度为6的圈数,但不决定长度为8的圈数。此外,WL [2]不确定4-团的数量。

英文摘要:

The classical Weisfeiler-Lehman method WL[2] uses edge colors to produce a powerful graph invariant. It is at least as powerful in its ability to distinguish non-isomorphic graphs as the most prominent algebraic graph invariants. It determines not only the spectrum of a graph, and the angles between standard basis vectors and the eigenspaces, but even the angles between projections of standard basis vectors into the eigenspaces. Here, we investigate the combinatorial power of WL[2]. For sufficiently large k, WL[k] determines all combinatorial properties of a graph. Many traditionally used combinatorial invariants are determined by WL[k] for small k. We focus on two fundamental invariants, the num- ber of cycles Cp of length p, and the number of cliques Kp of size p. We show that WL[2] determines the number of cycles of lengths up to 6, but not those of length 8. Also, WL[2] does not determine the number of 4-cliques.

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

↑