Reflection positivity, rank connectivity, and homomorphism of graphs
Reflection positivity, rank connectivity, and homomorphism of graphs
复制标题
DOI：
10.1090/s0894-0347-06-00529-7
复制
发表时间：
2004-04
影响因子：
3.9
通讯作者：
M. Freedman;L. Lovász;A. Schrijver
中科院分区：
文献类型：
--
作者：
M. Freedman;L. Lovász;A. Schrijver
它表明，一个图参数可以实现为一个固定（加权）图的同态的数量当且仅当它满足两个线性代数条件：反射正性和指数秩连通性。在统计物理学中，这可以被看作是顶点模型的配分函数的表征。
It is shown that a graph parameter can be realized as the number of homomorphisms into a fixed (weighted) graph if and only if it satisfies two linear algebraic conditions: reflection positivity and exponential rank-connectivity. In terms of statistical physics, this can be viewed as a characterization of partition functions of vertex models.