Binary tree summation Monte Carlo simulation for Potts models
arXiv:cond-mat/0206017 · doi:10.1016/S0378-4371(02)01794-6
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.
9 pages, 2 figures, for StatPhys-Taiwan 2002 conference
References in corpus (7)
- A fast Monte Carlo algorithm for site or bond percolation
- Transition Matrix Monte Carlo Method
- Combination of improved multibondic method and the Wang-Landau method
- Simulation of Potts models with real q and no critical slowing down
- Comments on Sweeny and Gliozzi dynamics for simulations of Potts models in the Fortuin-Kasteleyn representation
- Broad histogram relation for the bond number and its applications
- Random-cluster multi-histogram sampling for the q-state Potts model