图的相似性与同态密度
Graph Similarity and Homomorphism Densities
摘要:
我们引入了树距离,一个新的距离测量图。树距离可以用来自凸优化的标准方法在多项式时间内计算。它是基于分数同构的概念,一个表征的基础上的一个自然系统的线性方程组的整数解决方案对应于图形同构。根据Tinhofer(1986,1991)和Dvotelák(2010)的结果,两个图G和H是分数同构的当且仅当对于每一棵树T,从T到G的同态个数等于从T到H的同态个数,这意味着G和H的树距离为零。我们的主要结果是,等价关系“分数同构”和“等树同态密度”之间的对应关系可以扩展到相关的距离测度之间的对应关系。我们的结果受到了Lovász和Szegedy(2006)以及Borgs,Chayes,Lovász,Sós,and Vesztergombi(2008)的一个类似结果的启发,该结果将图的割距离与它们的同态密度(在所有图上)联系起来,这是图极限理论中的一个基本定理。我们还引入了图的路径距离,并将Dell,Grohe和Rounge(2018)的相应结果用于精确的路径同态计数到近似水平。我们的结果回答了Grohe(2020)的一个开放问题。我们建立我们的主要成果,我们的定义,以graphons,因为这使我们能够应用技术的功能分析。我们证明了相当一般的声明,对于每一个“合理”定义的图子伪度量,同态密度的精确对应可以变成一个近似。我们还提供了一个距离测量的例子,违反了这一合理性条件。这顺便回答了Grebík和Rocha(2021)的一个悬而未决的问题。
英文摘要:
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization based on a natural system of linear equations whose integer solutions correspond to graph isomorphism. By results of Tinhofer (1986, 1991) and Dvořák (2010), two graphs G and H are fractionally isomorphic if and only if, for every tree T, the number of homomorphisms from T to G equals the corresponding number from T to H, which means that the tree distance of G and H is zero. Our main result is that this correspondence between the equivalence relations "fractional isomorphism" and "equal tree homomorphism densities" can be extended to a correspondence between the associated distance measures. Our result is inspired by a similar result due to Lovász and Szegedy (2006) and Borgs, Chayes, Lovász, Sós, and Vesztergombi (2008) that connects the cut distance of graphs to their homomorphism densities (over all graphs), which is a fundamental theorem in the theory of graph limits. We also introduce the path distance of graphs and take the corresponding result of Dell, Grohe, and Rattan (2018) for exact path homomorphism counts to an approximate level. Our results answer an open question of Grohe (2020). We establish our main results by generalizing our definitions to graphons as this allows us to apply techniques from functional analysis. We prove the fairly general statement that, for every "reasonably" defined graphon pseudometric, an exact correspondence to homomorphism densities can be turned into an approximate one. We also provide an example of a distance measure that violates this reasonableness condition. This incidentally answers an open question of Grebík and Rocha (2021).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。