A theory on flat histogram Monte Carlo algorithms

DOI10.1007/S10955-005-8016-8MaRDI QIDQ2492779zbMATH OpenOpenAlexFDO

Authors Faming Liang

Publication date 14 June 2006

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10955-005-8016-8

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

Recommendations

• The Wang-Landau algorithm reaches the flat histogram criterion in finite time
• Intrinsic convergence properties of entropic sampling algorithms
• An introduction to Monte Carlo methods in statistical physics
• Convergence and refinement of the Wang-Landau algorithm
• scientific article; zbMATH DE number 1790430

Cited in

(7)

• Convergence of stochastic approximation Monte Carlo and modified Wang-Landau algorithms: tests for the Ising model
• Intrinsic convergence properties of entropic sampling algorithms
• Flat histogram Monte Carlo simulations of triangulated fixed-connectivity surface models
• Wang-Landau simulations with non-flat distributions
• Determining the density of states for classical statistical models by a flat-histogram random walk
• Optimized convergence for multiple histogram analysis
• Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities

This page was built for publication: A theory on flat histogram Monte Carlo algorithms

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