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(N 2) Experiments show good agreement with Onsager’s analytical solution for the two-dimensional Ising model of infinite size.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
