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

November 03, 2016 · Entered Twilight · 🏛 Optical Memory and Neural Networks

🌅 TWILIGHT: Old Age
Predates the code-sharing era — a pioneer of its time

"Last commit was 9.0 years ago (≥5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: Partition_Function.tar.gz, calc_determinant.hpp, coordinate_vertices.hpp, csparse.cpp, csparse.h, graph_types.hpp, main.cpp, pfaf_orientation.hpp, planar_dual.hpp, print_graph.hpp, vertex_unwrap.hpp

Authors Yakov M. Karandashev, Magomed Yu. Malsagov arXiv ID 1611.00922 Category cond-mat.dis-nn Cross-listed cond-mat.stat-mech, cs.DS, physics.comp-ph Citations 17 Venue Optical Memory and Neural Networks Repository https://github.com/Thrawn1985/2D-Partition-Function ⭐ 3 Last Checked 2 months ago
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 💻 Repository 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — cond-mat.dis-nn