Related papers: Flat histogram method comparison on 2D Ising Model
We implement the Wang-Landau algorithm in the context of SU(N) lattice gauge theories. We study the quenched, reduced version of the lattice theory and calculate its density of states for N=20,30,40,50. We introduce a variant of the…
We review the recently developed critical minimum energy-subspace (CrMES) technique. This scheme produces an immense optimization of popular algorithms, such as the Wang-Landau (WL) and broad histogram methods, by predicting the essential…
The HP model of protein folding, where the chain exists in a free medium, is investigated using a parallel Monte Carlo scheme based upon Wang-Landau sampling. Expanding on the work of Wust and Landau by introducing a lesser known replica…
Multicanonical molecular dynamics (MD) is a powerful technique for sampling conformations on rugged potential surfaces such as protein. However, it is notoriously difficult to estimate the multicanonical temperature effectively. Wang and…
The three-dimensional bimodal random-field Ising model is studied via a new finite temperature numerical approach. The methods of Wang-Landau sampling and broad histogram are implemented in a unified algorithm by using the N-fold version of…
We present a Monte Carlo method that efficiently computes the density of states for spin models having any number of interaction per spin. By combining a random-walk in the energy space with collective updates controlled by the…
Wang-Landau simulations offer the possibility to integrate explicitly over a collective coordinate and stochastically over the remainder of configuration space. We propose to choose the so-called "slow mode", which is responsible for large…
The ubiquity of sequences in many domains enhances significant recent interest in sequence learning, for which a basic problem is how to measure the distance between sequences. Dynamic time warping (DTW) aligns two sequences by nonlinear…
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…
A new approach known as flat histogram method is used to study the +/-J Ising spin glass in two dimensions. Temperature dependence of the energy, the entropy, and other physical quantities can be easily calculated and we give the results…
We show that Wang-Landau sampling, combined with suitable Monte Carlo trial moves, provides a powerful method for both the ground state search and the determination of the density of states for the hydrophobic-polar (HP) protein model and…
We presented an efficient algorithm, fast adaptive flat-histogram ensemble (FAFE), to estimate the density of states (DOS) and to enhance sampling in large systems. FAFE calculates the means of an arbitrary extensive variable $U$ in…
We investigate and contrast, via the Wang-Landau (WL) algorithm, the effects of quenched bond randomness on the self-averaging properties of two Ising spin models in 2d. The random bond version of the superantiferromagnetic (SAF) square…
In this communication, the convergence of the 1/t and Wang - Landau algorithms in the calculation of multidimensional numerical integrals is analyzed. Both simulation methods are applied to a wide variety of integrals without restrictions…
We describe an efficient Monte Carlo algorithm using a random walk in energy space to obtain a very accurate estimate of the density of states for classical statistical models. The density of states is modified at each step when the energy…
Wang-Landau sampling (WLS) of large systems requires dividing the energy range into "windows" and joining the results of simulations in each window. The resulting density of states (and associated thermodynamic functions) are shown to…
In this short note, we show how the parallel adaptive Wang-Landau (PAWL) algorithm of Bornn et al. (2013) can be used to automate and improve simulated tempering algorithms. While Wang-Landau and other stochastic approximation methods have…
We introduce a rejection-free, flat histogram, cluster algorithm to determine the density of states of hard-core lattice gases. We show that the algorithm is able to efficiently sample low entropy states that are usually difficult to…
Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where its entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number…
While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the…