Related papers: Convergence of the Wang-Landau algorithm
We provide analysis of the convergence properties and applicability extensions of flat-histogram algorithms, with a particular focus on the Wang-Landau algorithms (exemplified by converging stochastic approximation Monte Carlo (SAMC)) and…
We investigate the behavior of the deviation of the estimator for the density of states (DOS) with respect to the exact solution in the course of Wang-Landau and Stochastic Approximation Monte Carlo (SAMC) simulations of the two-dimensional…
We propose a method based on the Wang-Landau algorithm to numerically generate the spectral densities of random matrix ensembles. The method employs Dyson's log-gas formalism for random matrix eigenvalues and also enables one to…
We propose a simple method to estimate the central charge of the conformal field theory corresponding to a critical point of a two-dimensional lattice model from Monte Carlo simulations. The main idea is to use the Wang-Landau…
Performance of Wang-Landau (W-L) algorithm in two continuous spin models is tested by determining the fluctuations in energy histogram. Finite size scaling is performed on a modified XY-model using different W-L sampling schemes.…
We show that a histogram maintained throughout the Wang-Landau (WL) sampling for the energy entries visited during the simulation could be used to make the simulated density of states (DOS) converge. The method is easy to be implemented to…
Because of their multimodality, mixture posterior distributions are difficult to sample with standard Markov chain Monte Carlo (MCMC) methods. We propose a strategy to enhance the sampling of MCMC in this context, using a biasing procedure…
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…
We implement a Wang-Landau sampling technique in quantum Monte Carlo (QMC) for the purpose of calculating the Renyi entanglement entropies and associated mutual information. The algorithm converges an estimate for an analogue to the density…
We propose an adaptive biasing algorithm aimed at enhancing the sampling of multimodal measures by Langevin dynamics. The underlying idea consists in generalizing the standard adaptive biasing force method commonly used in conjunction with…
It is shown in this work how the Wang-Landau algorithm can be parallelized through the concept of the micromagnetic ensemble, when the Hamiltonian contains both spin interaction and the external field terms, and thus energy-magnetization…
We present a simple and efficient approximation scheme which greatly facilitates extension of Wang-Landau sampling (or similar techniques) in large systems for the estimation of critical behavior. The method, presented in an algorithmic…
We analyze the efficiency of the Wang-Landau algorithm to sample a multimodal distribution on a prototypical simple test case. We show that the exit time from a metastable state is much smaller for the Wang Landau dynamics than for the…
The development of new algorithms for simulations in physics is as important as the development of new analytical methods. In this paper, we present a comparison of the recently developed microcanonical population annealing (MCPA) algorithm…
Wang and Landau proposed recently, a simple and flexible non-Boltzmann Monte Carlo method for estimating the density of states, from which the macroscopic properties of a closed system can be calculated. They demonstrated their algorithm by…
We study the mechanism behind dynamical trappings experienced during Wang-Landau sampling of continuous systems reported by several authors. Trapping is caused by the random walker coming close to a local energy extremum, although the…
By mixing the target posterior distribution with a surrogate distribution, of which the normalizing constant is tractable, we propose a method for estimating the marginal likelihood using the Wang-Landau algorithm. We show that a faster…
Critical properties of lattice gases with nearest-neighbor exclusion are investigated via the adaptive-window Wang-Landau algorithm on the square and simple cubic lattices, for which the model is known to exhibit an Ising-like phase…
The 1/t Wang-Landau algorithm is analyzed from the viewpoint of execution time and accuracy when it is used in computations of the density of states of a two-dimensional Ising model. We find that the simulation results have a systematic…
A modification of the Adaptive Biasing Force method is introduced, in which the free energy is approximated by a sum of tensor products of one-dimensional functions. This enables to handle a larger number of reaction coordinates than the…