Binary tree summation Monte Carlo simulation for Potts models
Jian-Sheng Wang
Abstract
In this talk, we briefly comment on Sweeny and Gliozzi methods, cluster Monte Carlo method, and recent transition matrix Monte Carlo for Potts models. We mostly concentrate on a new algorithm known as "binary tree summation". Some of the most interesting features of this method will be highlighted - such as simulating fractional number of Potts states, as well as offering the partition function and thermodynamic quantities as functions of temperature in a single run.
Create a lesson
Related papers
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo
Lattice spin systems coupled to a compact U(1) gauge field with negative gauge coupling favoring frustration
Claudio Bonati, Ettore Vicari
The Inverse Mean First-Passage Time Problem
Tommer D. Keidar, Shlomi Reuveni, Igor M. Sokolov
Restricted triangular ice beyond the solvable manifolds: chiral ice and the critical region of dominant chiral vertices
Josep Batle
Establishing Néel order in the square-lattice antiferromagnetic Heisenberg model: a bootstrap proof
Nisarg Chadha, Taige Wang, Pavel A. Nosov et al.