Binary tree summation Monte Carlo simulation for Potts models

DOI10.1016/S0378-4371(02)01794-6zbMATH Open1037.82026arXivcond-mat/0206017MaRDI QIDQ1865451FDOQ1865451

Authors: Jian-Sheng Wang 

Publication date: 26 March 2003

Published in: Physica A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/cond-mat/0206017

Recommendations

• A nonlocal Monte Carlo algorithm for lattice trees
• Nested sampling, statistical physics and the Potts model
• Cluster Monte Carlo: Extending the range
• Accelerated algorithms. I: Lattice models
• Novel Monte Carlo algorithms and their applications

zbMATH Keywords

partition functiontemperature dependencefractional state-number simulation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to statistical mechanics (82-02) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Transition matrix Monte Carlo method

Cited In (3)

• Polya tree Monte Carlo method
• Critical points of the random cluster model with Newman–Ziff sampling
• Monte Carlo simulation study of the two-stage percolation transition in enhanced binary trees

This page was built for publication: Binary tree summation Monte Carlo simulation for Potts models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865451)