2000 character limit reached
Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs
Published 3 Nov 2016 in cond-mat.dis-nn, cond-mat.stat-mech, cs.DS, and physics.comp-ph | (1611.00922v1)
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(N2). Test experiments shows good agreement with Onsager's analytical solution for two-dimensional Ising model of infinite size.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
