Мақаланы E-mail арқылы жіберу Polynomial algorithm for exact calculation of partition function for binary spin model on planar graphs
- Авторлар: Karandashev Y.M.1, Malsagov M.Y.1
-
Мекемелер:
- Center of Optical Neural Technologies Scientific Research Institute for System Analysis RAS
- Шығарылым: Том 26, № 2 (2017)
- Беттер: 87-95
- Бөлім: Article
- URL: https://journals.rcsi.science/1060-992X/article/view/194959
- DOI: https://doi.org/10.3103/S1060992X17020035
- ID: 194959
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
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(N2) Experiments show good agreement with Onsager’s analytical solution for the two-dimensional Ising model of infinite size.
Негізгі сөздер
Авторлар туралы
Ya. Karandashev
Center of Optical Neural Technologies Scientific Research Institute for System Analysis RAS
Хат алмасуға жауапты Автор.
Email: Karandashev@niisi.ras.ru
Ресей, Moscow
M. Malsagov
Center of Optical Neural Technologies Scientific Research Institute for System Analysis RAS
Email: Karandashev@niisi.ras.ru
Ресей, Moscow
Қосымша файлдар
