Wang-Landau algorithm: an adapted random walk to boost convergence
type: Item
instance of: scholarly article
title: Wang-Landau algorithm: an adapted random walk to boost convergence
zbMATH Open document ID: 1436.65005
published in: Journal of Computational Physics
publication date: 2020-07-07T00:00:00Z
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 65C40
Mathematics Subject Classification ID: 82M31
zbMATH DE Number: 7218388
zbMATH Keywords: density of states
zbMATH Keywords: numerical integration
zbMATH Keywords: MCMC
zbMATH Keywords: importance sampling
zbMATH Keywords: Wang-Landau
zbMATH Keywords: high dimensional spaces
author: Augustin Chevallier
author: Frédéric Cazals
describes a project that uses: SBL
MaRDI profile type: Publication
full work available at URL: j.jcp.2020.109366
OpenAlex ID: W2923551037
cites work: Q3560913
cites work: Monte Carlo Simulations in Statistical Physics — From Basic Principles to Advanced Applications
cites work: Monte Carlo sampling methods using Markov chains and their applications
cites work: The Wang-Landau algorithm reaches the flat histogram criterion in finite time
cites work: Convergence of the Wang-Landau algorithm
cites work: A \(1/t\) algorithm with the density of two states for estimating multidimensional integrals
cites work: Markov chains and stochastic stability
cites work: A note on Metropolis-Hastings kernels for general state spaces
cites work: Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
cites work: Optimal scaling for various Metropolis-Hastings algorithms.
cites work: Generalized darting Monte Carlo
cites work: Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
cites work: Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
DOI: 10.1016/J.JCP.2020.109366
description: scientific article; zbMATH DE number 7218388