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!

container_end_page
container_issue
container_start_page
container_title
container_volume
creator	Karandashev, Yakov M Malsagov, Magomed Yu
description	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_str_mv	10.48550/arxiv.1611.00922
format	Article
fullrecord	<record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1611_00922</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1611_00922</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-22b2d75adb4c2a447bd544ae4b53c6fb477a1e6eb254d43a748e9b468209ff073</originalsourceid><addsrcrecordid>eNotj81ugzAQhH3JoUr6AD3VLwC1zRrDsYr6J0VqDrmjtbGJJYORIVXy9qWkp92dWY3mI-SJsxwqKdkLpqv_yXnJec5YLcQD6Y4x3IbYewwUQxeTn889dTFRe0UzU4PBXALOPg40Ojpimv16uMtg7svyq_2A6Uan0Q-0j60NdDHGgItKu4TjedqRjcMw2cf_uSWn97fT_jM7fH987V8PGZZKZEJo0SqJrQYjEEDpVgKgBS0LUzoNSiG3pdVCQgsFKqhsraGsBKudY6rYkud77ErajMn3S7Hmj7hZiYtfWkVTKA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs</title><source>arXiv.org</source><creator>Karandashev, Yakov M ; Malsagov, Magomed Yu</creator><creatorcontrib>Karandashev, Yakov M ; Malsagov, Magomed Yu</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.1611.00922</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Physics - Computational Physics ; Physics - Disordered Systems and Neural Networks ; Physics - Statistical Mechanics</subject><creationdate>2016-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1611.00922$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1611.00922$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Karandashev, Yakov M</creatorcontrib><creatorcontrib>Malsagov, Magomed Yu</creatorcontrib><title>Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs</title><description>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.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Physics - Computational Physics</subject><subject>Physics - Disordered Systems and Neural Networks</subject><subject>Physics - Statistical Mechanics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81ugzAQhH3JoUr6AD3VLwC1zRrDsYr6J0VqDrmjtbGJJYORIVXy9qWkp92dWY3mI-SJsxwqKdkLpqv_yXnJec5YLcQD6Y4x3IbYewwUQxeTn889dTFRe0UzU4PBXALOPg40Ojpimv16uMtg7svyq_2A6Uan0Q-0j60NdDHGgItKu4TjedqRjcMw2cf_uSWn97fT_jM7fH987V8PGZZKZEJo0SqJrQYjEEDpVgKgBS0LUzoNSiG3pdVCQgsFKqhsraGsBKudY6rYkud77ErajMn3S7Hmj7hZiYtfWkVTKA</recordid><startdate>20161103</startdate><enddate>20161103</enddate><creator>Karandashev, Yakov M</creator><creator>Malsagov, Magomed Yu</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20161103</creationdate><title>Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs</title><author>Karandashev, Yakov M ; Malsagov, Magomed Yu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-22b2d75adb4c2a447bd544ae4b53c6fb477a1e6eb254d43a748e9b468209ff073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Physics - Computational Physics</topic><topic>Physics - Disordered Systems and Neural Networks</topic><topic>Physics - Statistical Mechanics</topic><toplevel>online_resources</toplevel><creatorcontrib>Karandashev, Yakov M</creatorcontrib><creatorcontrib>Malsagov, Magomed Yu</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Karandashev, Yakov M</au><au>Malsagov, Magomed Yu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs</atitle><date>2016-11-03</date><risdate>2016</risdate><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.</abstract><doi>10.48550/arxiv.1611.00922</doi><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier	DOI: 10.48550/arxiv.1611.00922
ispartof
issn
language	eng
recordid	cdi_arxiv_primary_1611_00922
source	arXiv.org
subjects	Computer Science - Data Structures and Algorithms Physics - Computational Physics Physics - Disordered Systems and Neural Networks Physics - Statistical Mechanics
title	Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T05%3A56%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Polynomial%20algorithm%20for%20exact%20calculation%20of%20partition%20function%20for%20binary%20spin%20model%20on%20planar%20graphs&rft.au=Karandashev,%20Yakov%20M&rft.date=2016-11-03&rft_id=info:doi/10.48550/arxiv.1611.00922&rft_dat=%3Carxiv_GOX%3E1611_00922%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true