点击下载:《计算机科学》相关教学资源(参考文献)Spatial mixing and the connective constant - Optimal bounds
正在加载图片...
undirected graph G=(V,E) monomer-dimer model:set of all matchings M(G) partition function ZA(G)=XIMI M∈M(G)Z(G) = X M2M(G) |M| monomer-dimer model: M(G) undirected graph G = (V,E) set of all matchings partition function
<<向上翻页
向下翻页>>
点击下载:《计算机科学》相关教学资源(参考文献)Spatial mixing and the connective constant - Optimal bounds
©2008-现在 cucdc.com 高等教育资讯网 版权所有