Email this article Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs
- Authors: Karandashev Y.M.1, Malsagov M.Y.1
-
Affiliations:
- Center of Optical Neural Technologies Scientific Research Institute for System Analysis RAS
- Issue: Vol 26, No 2 (2017)
- Pages: 87-95
- Section: Article
- URL: https://journals.rcsi.science/1060-992X/article/view/194959
- DOI: https://doi.org/10.3103/S1060992X17020035
- ID: 194959
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
Ya. M. Karandashev
Center of Optical Neural Technologies Scientific Research Institute for System Analysis RAS
Author for correspondence.
Email: Karandashev@niisi.ras.ru
Russian Federation, Moscow
M. Yu. Malsagov
Center of Optical Neural Technologies Scientific Research Institute for System Analysis RAS
Email: Karandashev@niisi.ras.ru
Russian Federation, Moscow
Supplementary files
