Related papers: Efficiency of the Wang-Landau algorithm: a simple …
It has been shown that the Metropolis algorithm can be implemented on quantum computers in a way that avoids the sign problem. However, flat histogram techniques are often preferred as they don't suffer from the same limitations that…
The density of states of continuous models is known to span many orders of magnitudes at different energies due to the small volume of phase space near the ground state. Consequently, the traditional Wang-Landau sampling which uses the same…
As far as we know, there is no flat-histogram algorithm to sample the stationary distribution of non-equilibrium stochastic processes. The present work addresses this gap by introducing a generalization of the Wang-Landau algorithm, applied…
We present a method for estimating the density of states of a classical statistical model. The algorithm successfully combines the Wang-Landau flat histogram method with the N-fold way in order to improve efficiency of the original single…
The Wang-Landau algorithm aims at sampling from a probability distribution, while penalizing some regions of the state space and favoring others. It is widely used, but its convergence properties are still unknown. We show that for some…
We show that the Wang-Landau algorithm can be formulated as a stochastic gradient descent algorithm minimizing a smooth and convex objective function, of which the gradient is estimated using Markov chain Monte Carlo iterations. The…
We analyze the convergence properties of the Wang-Landau algorithm. This sampling method belongs to the general class of adaptive importance sampling strategies which use the free energy along a chosen reaction coordinate as a bias. Such…
We present a study on the performance of Wang-Landau algorithm in a lattice model of liquid crystals which is a continuous lattice spin model. We propose a novel method of the spin update scheme in a continuous lattice spin model. The…
We show how the well-known Wang-Landau method can be modified to produce non-flat distributions. Through the choice of a suitable profile this can lead to an increase in efficiency for some systems. Examples for such an enhancement are…
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 generalized approach to Wang-Landau simulations, macroscopically constrained Wang-Landau, is proposed to simulate the density of states of a system with multiple macroscopic order parameters. The method breaks a multidimensional…
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…
We considered a higher-dimensional extension for the replica-exchange Wang-Landau algorithm to perform a random walk in the energy and magnetization space of the two-dimensional Ising model. This hybrid scheme combines the advantages of…
We implement the Wang-Landau algorithm to sample with equal probabilities the static configurations of a model granular system. The "non-interacting rigid arch model" used is based on the description of static configurations by means of…
Recently, Wang and Landau proposed a new random walk algorithm that can be very efficiently applied to many problems. Subsequently, there has been numerous studies on the algorithm itself and many proposals for improvements were put…
We propose a flat-histogram Monte Carlo method to efficiently sample fractal landscapes such as escape time functions of open chaotic systems. This is achieved by using a random-walk step which depends on the height of the landscape via the…
Monte Carlo simulations using Wang-Landau sampling are performed to study three-dimensional chains of homopolymers on a lattice. We confirm the accuracy of the method by calculating the thermodynamic properties of this system. Our results…
In this work we develop an implementation of the Wang--Landau algorithm [Phys. Rev. Lett. \textbf{86}, 2050-2053 (2001)]. This algorithm allows us to find the density of states (DOS), a function that, for a given system, describes the…
We study the long-time dynamics in non-Markovian single-population stochastic models, where one or more reactions are modelled as a stochastic process with a fat-tailed non-exponential distribution of waiting times, mimicking long-term…
Metropolis algorithm has been extensively employed for simulating a canonical ensemble and estimating macroscopic properties of a closed system at any desired temperature. A mechanical property, like energy can be calculated by averaging…