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

Resumo

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(N²) Experiments show good agreement with Onsager’s analytical solution for the two-dimensional Ising model of infinite size.