Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs
Disordered Systems and Neural Networks
2016-11-04 v1 Statistical Mechanics
Data Structures and Algorithms
Computational Physics
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.
Cite
@article{arxiv.1611.00922,
title = {Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs},
author = {Yakov M. Karandashev and Magomed Yu. Malsagov},
journal= {arXiv preprint arXiv:1611.00922},
year = {2016}
}
Comments
9 pages, 10 figure