Convergence and refinement of the Wang-Landau algorithm

DOI10.1016/j.cpc.2006.02.009zbMath1196.82054arXivcond-mat/0506555OpenAlexW1974390117MaRDI QIDQ710026

Hwee Kuan Lee, D. P. Landau, Yutaka Okabe

Publication date: 18 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

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

zbMATH Keywords

Monte Carlorandom walkdensity of states

Mathematics Subject Classification ID

Related Items (10)

Computer simulation of two continuous spin models using Wang-Landau-transition-matrix Monte Carlo algorithm ⋮ Universality aspects of the 2d random-bond Ising and 3D Blume-Capel models ⋮ Wang-Landau sampling: saving CPU time ⋮ Monte Carlo simulation of joint density of states in one-dimensional Lebwohl-Lasher model using Wang-Landau algorithm ⋮ Performance of Wang-Landau algorithm in continuous spin models and a case study: Modified XY-model ⋮ Multicanonical MCMC for sampling rare events: an illustrative review ⋮ Intrinsic convergence properties of entropic sampling algorithms ⋮ Bayesian computation: a summary of the current state, and samples backwards and forwards ⋮ TWO-DIMENSIONAL WANG–LANDAU SAMPLING OF AN ASYMMETRIC ISING MODEL ⋮ Phase transition of Laplacian roughening model on a triangular lattice using Wang–Landau Monte Carlo simulation and Fisher zeros

Cites Work

• Unnamed Item
• Monte Carlo algorithms based on the number of potential moves
• Three-dimensional antiferromagneticq-state Potts models: application of the Wang-Landau algorithm
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Convergence and refinement of the Wang-Landau algorithm