Binary tree summation Monte Carlo simulation for Potts models

Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0378-4371(02)01794-6

Title:	Binary tree summation Monte Carlo simulation for Potts models
Authors:	Wang, J.-S.
Keywords:	Binary tree summation Cluster algorithm Gliozzi algorithm Ising model Sweeny algorithm
Issue Date:	1-Apr-2003
Citation:	Wang, J.-S. (2003-04-01). Binary tree summation Monte Carlo simulation for Potts models. Physica A: Statistical Mechanics and its Applications 321 (1-2) : 351-358. ScholarBank@NUS Repository. https://doi.org/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. © 2003 Elsevier Science B.V. All rights reserved.
Source Title:	Physica A: Statistical Mechanics and its Applications
URI:	http://scholarbank.nus.edu.sg/handle/10635/104902
ISSN:	03784371
DOI:	10.1016/S0378-4371(02)01794-6
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check