Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Nuclear Physics B

Cluster algorithms for the generalized 3d, 3q Potts model

Enzo Marinari, R. Marra

Published Oct 1, 1990• 5 citations
Publisher
DOI
10.1016/0550-3213(90)90335-b

Related papers

A finite-size scaling study of the diamond 3d 3q potts model

Massimo Bernaschi, Marco Guagnelli, Enzo Marinari +1 more

Nuclear Physics B•Aug 1, 1991•0 citations

A comparison of cluster algorithms for Potts models

Paul David Coddington, CLIVE F. BAILLIE

Nuclear Physics B - Proceedings Supplements•Sep 1, 1990•4 citations

Multicanonical cluster algorithm and the two-dimensional 7-state Potts model

Kari Rummukainen

arXiv:hep-lat/9209024•Nuclear Physics B•Feb 1, 1993•42 citations

MC-simulation of the 3D,q=3 Potts model

Matthias Schmidt

The European Physical Journal B•Sep 1, 1994•18 citations

Phase transition properties of 3D Potts models

Alexei Bazavov, Bernd A. Berg, Santosh Dubey

arXiv:0804.1402•Nuclear Physics B•Apr 28, 2008•39 citations

Single-cluster dynamics for the random-cluster model

Youjin Deng, Xiaofeng Qian, Henk W. J. Blöte

We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.

arXiv:0907.1711•Physical Review E•Sep 30, 2009•5 citations
We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.