Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs

Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs

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 agre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Karandashev, Yakov M, Malsagov, Magomed Yu
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Data Structures and Algorithms
Physics - Computational Physics
Physics - Disordered Systems and Neural Networks
Physics - Statistical Mechanics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.1611.00922