arXiv · 1611.00922
Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs
Abstract
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity of the algorithm is O(N^2). Test experiments shows good agreement with Onsager's analytical solution for two-dimensional Ising model of infinite size.
Explore related subjects
Keep this discovery
Yakov M. Karandashev, Magomed Yu. Malsagov. 2016-11-03. Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs. https://arxiv.org/abs/1611.00922
Cite the original work for its findings. Save a collection to share your selection of sources.