Related papers: Monte Carlo simulation of joint density of states …
Monte Carlo simulation using the Wang-Landau algorithm has been performed in an one-dimensional Lebwohl-Lasher model. Both one-dimensional and two-dimensional random walks have been carried out. The results are compared with the exact…
Monte Carlo simulation using a combination of Wang Landau (WL) and Transition Matrix (TM) Monte Carlo algorithms to simulate two lattice spin models with continuous energy is described. One of the models, the one dimensional Lebwohl-Lasher…
We present an efficient Monte Carlo algorithm for determining the density of states which is based on the statistics of transition probabilities between states. By measuring the infinite temperature transition probabilities--that is, the…
A macroscopically constrained Wang-Landau Monte Carlo method was recently proposed to calculate the joint density of states (DOS) for systems with multiple order parameters. Here we demonstrate results for a nearest-neighbor Ising…
A Monte Carlo method based on a density-of-states sampling is proposed for study of arbitrary statistical mechanical ensembles in a continuum. A random walk in the two-dimensional space of particle number and energy is used to estimate the…
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…
We review recent advances in the analysis of the Wang--Landau algorithm, which is designed for the direct Monte Carlo estimation of the density of states (DOS). In the case of a discrete energy spectrum, we present an approach based on…
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…
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…
We propose a method for Monte Carlo simulation of statistical physical models with discretized energy. The method is based on several ideas including the cluster algorithm, the multicanonical Monte Carlo method and its acceleration proposed…
Using Wang-landau algorithm combined with analytic method, the density of states of two dimensional XY model on square lattices of sizes $16\times16$, $24\times24$ and $32\times32$ is accurately calculated. Thermodynamic quantities, such as…
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…
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…
We present modified Wang-Landau algorithm for models with continuous degrees of freedom. We demonstrate this algorithm with the calculation of the joint density of states $g(M,E)$ of ferromagnet Heisenberg models. The joint density of…
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 present a rigorous derivation for off-lattice implementations of the so-called "random-walk" algorithm recently introduced by Wang and Landau [PRL 86, 2050 (2001)]. Originally developed for discrete systems, the algorithm samples…
The Wang-Landau (WL) algorithm has been widely used for simulations in many areas of physics. Our analysis of the WL algorithm explains its properties and shows that the difference of the largest eigenvalue of the transition matrix in the…
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…
We introduce a generic, parallel Wang-Landau method that is naturally suited to implementation on massively parallel, petaflop supercomputers. The approach introduces a replica-exchange framework in which densities of states for overlapping…
This paper discusses some convergence properties in the entropic sampling Monte Carlo methods with multiple random walkers, particularly in the Wang-Landau (WL) and $1/t$ algorithms. The classical algorithms are modified by the use of $m$…