Related papers: Applying the Wang-Landau Algorithm to Lattice Gaug…
The density of states is calculated for a SU(2) and a compact U(1) lattice gauge theory using a modified version of the Wang-Landau algorithm. We find that the density of states of the SU(2) gauge theory can be reliably calculated over a…
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…
In Wang-Landau type algorithms, Monte-Carlo updates are performed with respect to the density of states, which is iteratively refined during simulations. The partition function and thermodynamic observables are then obtained by standard…
In this work we present a theoretical analysis of the convergence of the Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] which was introduced years ago to calculate the density of states in statistical models. We study the…
An algorithm to calculate the density of states, based on the well-known Wang-Landau method, is introduced. Independent random walks are performed in different restricted ranges of energy, and the resultant density of states is modified by…
Paying attention to the difference of density of states, \Delta ln g(E) = ln g(E+\Delta E) - ln g(E), we study the convergence of the Wang-Landau method. We show that this quantity is a good estimator to discuss the errors of convergence,…
We present a novel algorithm to compute the density of states, which is proven to converge to the correct result. The algorithm is very general and can be applied to a wide range of models, in the frameworks of Statistical Mechanics and…
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 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…
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…
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 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…
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…
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…
We study the validity of the large-N equivalence between four-dimensional SU(N) lattice gauge theory and its momentum quenched version--the Quenched Eguchi-Kawai (QEK) model. We find that the assumptions needed for the proofs of equivalence…
We use the Logarithmic Linear Relaxation (LLR) density of states algorithm to study the bulk phase transitions of pure-gauge SU($N$) lattice Yang--Mills theories with $4 \leq N \leq 8$. This approach avoids super-critical slowing down at…
We present a generalization of the classical Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] to quantum systems. The algorithm proceeds by stochastically evaluating the coefficients of a high temperature series expansion or a…
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…
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 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…