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

Computer Physics Communications

Multibondic cluster algorithm for finite-size scaling studies of critical phenomena

Bernd A. Berg, Wolfhard Janke E

Published Jan 28, 2008• 1 citation
Publisher
DOI
10.1016/j.cpc.2008.01.011

Related papers

Multibondic cluster algorithm

Wolfhard Janke E, Stefan Kappler

arXiv:hep-lat/9411077•Nuclear Physics B - Proceedings Supplements•Apr 1, 1995•7 citations

Critical Phenomena and Finite—Size Scaling

N. S. Tonchev, Angelos Angelopoulos, Takis Fildisis

AIP conference proceedings•Jan 1, 2010•0 citations

Probability-changing cluster algorithm for the study of critical phenomena

裕介 富田

•Jan 1, 2002•0 citations

Parallel-tempering cluster algorithm for computer simulations of critical phenomena

Elmar Bittner, Wolfhard Janke E

In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel-tempering algorithm with cluster updates and an adaptive routine to find the temperature window of interest, we introduce a flexible and powerful method for systematic investigations of critical phenomena. As a result, we gain one to two orders of magnitude in the performance for two- and three-dimensional Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.

arXiv:1107.5640•Physical Review E•Sep 1, 2011•15 citations

Replica-exchange cluster algorithm

Wolfhard Janke E, Elmar Bittner

In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point.By combining the replica-exchange algorithm with cluster updates and an adaptive routine to find the range of interest, we introduce a new flexible and powerful method for systematic investigations of critical phenomena.As a result, we gain two further orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.

arXiv:1108.0354•International Symposium on Lattice Field Theory (LATTICE)•Jun 23, 2010•0 citations

Theory of Critical Phenomena in Finite-Size Systems

J.G. Brankov, Daniel M. Danchev, N. S. Tonchev

Series in modern condensed matter physics•Aug 1, 2000•203 citations
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel-tempering algorithm with cluster updates and an adaptive routine to find the temperature window of interest, we introduce a flexible and powerful method for systematic investigations of critical phenomena. As a result, we gain one to two orders of magnitude in the performance for two- and three-dimensional Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point.By combining the replica-exchange algorithm with cluster updates and an adaptive routine to find the range of interest, we introduce a new flexible and powerful method for systematic investigations of critical phenomena.As a result, we gain two further orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.