In this paper, we relate a beautiful theory by Lovász with a popular heuristic algorithm for the graph isomorphism problem, namely the color refinement algorithm and its k-dimensional generalization known as the Weisfeiler-Leman algorithm. We prove that two graphs G and H are indistinguishable by the color refinement algorithm if and only if, for all trees T, the number Hom(T,G) of homomorphisms from T to G equals the corresponding number Hom(T,H) for H.
There is a natural system of linear equations whose nonnegative integer solutions correspond to the isomorphisms between two graphs. The nonnegative real solutions to this system are called fractional isomorphisms, and two graphs are fractionally isomorphic if and only if the color refinement algorithm cannot distinguish them (Tinhofer 1986, 1991). We show that, if we drop the nonnegativity constraints, that is, if we look for arbitrary real solutions, then a solution to the linear system exists if and only if, for all t, the two graphs have the same number of length-t walks.
We lift the results for trees to an equivalence between numbers of homomorphisms from graphs of tree width k, the k-dimensional Weisfeiler-Leman algorithm, and the level-k Sherali-Adams relaxation of our linear program. We also obtain a partial result for graphs of bounded path width and solutions to our system where we drop the nonnegativity constraints. A consequence of our results is a quasi-linear time algorithm to decide whether, for two given graphs G and H, there is a tree T with Hom(T,G) = Hom(T,H).
我们介绍了深度Weisfeiler-Leman算法(DeepWL)的框架,它允许设计比著名的Weisfeiler-Leman算法更强大的纯组合图同构测试。我们证明,作为一个抽象的计算模型,多项式时间DeepWL算法具有与Blass,Gurevich和Shelah(Ann. Pure Appl. Logic.,1999年)这是一个众所周知的开放问题是否存在一个多项式时间图同构测试意味着存在一个多项式时间规范化算法。我们的主要技术结果表明,对于每一类图(满足一些温和的封闭条件),如果存在多项式时间DeepWL同构测试,则存在该类的多项式规范化算法。这意味着在这个类上还有一个捕获多项式时间的逻辑。
Weisfeiler and Leman go Machine Learning: The Story so far
RWTH Aachen University(亚琛工业大学);Meta AI Research(Meta人工智能研究院);Weizmann Institute of Science(魏茨曼科学研究所);NVIDIA Research(英伟达研究院);Helmholtz Zentrum München(慕尼黑亥姆霍兹中心);Technical University of Munich(慕尼黑工业大学);University of Vienna(维也纳大学);ETH Zürich(苏黎世联邦理工学院);Swiss Institute of Bioinformatics(瑞士生物信息学研究所);Max Planck Institute of Biochemistry(马克斯·普朗克生物化学研究所)
Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width
Hasso Plattner Institute, University of Potsdam(波茨坦大学哈索·普拉特纳研究所);Postdoc Network Brandenburg Institute of Logic and Computation, TU Wien(维也纳技术学院勃兰登堡逻辑与计算博士后网络);School of Electronic Engineering and Computer Science, Queen Mary University of London(伦敦玛丽女王大学电子工程与计算机科学学院)