Efficiency of the Wang-Landau Algorithm: A Simple Test Case
From MaRDI portal
Publication:2927897
DOI10.1093/amrx/abu003zbMath1317.65010arXiv1310.6550OpenAlexW2095714768MaRDI QIDQ2927897
Tony Lelièvre, Benjamin Jourdain, Gabriel Stoltz, Estelle Kuhn, Gersende Fort
Publication date: 5 November 2014
Published in: Applied Mathematics Research eXpress (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6550
Markov chain Monte CarloMetropolis-Hastings algorithmnumerical resultWang-Landau algorithmadaptive importance samplingcomputational statistical physics
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Hypocoercivity in metastable settings and kinetic simulated annealing ⋮ Convergence and efficiency of adaptive importance sampling techniques with partial biasing ⋮ Self-healing umbrella sampling: convergence and efficiency ⋮ Convergence of the Wang-Landau algorithm ⋮ Metropolized Randomized Maximum Likelihood for Improved Sampling from Multimodal Distributions
This page was built for publication: Efficiency of the Wang-Landau Algorithm: A Simple Test Case
