Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs

被引：0
|
作者：
Karandashev Y.M. [1 ]
Malsagov M.Y. [1 ]
机构：
[1] Center of Optical Neural Technologies Scientific Research Institute for System Analysis RAS, Moscow
来源：
Optical Memory and Neural Networks | 2017年 / 26卷 / 2期
关键词：
binary model; Ising model; partition function; Planar graph; polynomial algorithm;
D O I：
10.3103/S1060992X17020035
中图分类号：
学科分类号：
摘要：
In this paper we propose and realize an algorithm for exact calculation of partition function for planar graph models with binary variables. The complexity of the algorithm is O(N2) Experiments show good agreement with Onsager’s analytical solution for the two-dimensional Ising model of infinite size. © 2017, Allerton Press, Inc.
引用
收藏
页码：87 / 95
页数：8
相关论文
共 50 条
12345