相关论文: Difference of energy density of states in the Wang…

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…

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…

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…

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…

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 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 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…

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…

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$…

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…

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…

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 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 study the convergence of the density of states and thermodynamic properties in three flat-histogram simulation methods, the Wang-Landau (WL) algorithm, the 1/t algorithm, and tomographic sampling (TS). In the first case the refinement…

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…

Phase transitions are ubiquitous phenomena, exemplified by the melting of ice and spontaneous magnetization of magnetic material. In general, a phase transition is associated with a symmetry breaking of a system; occurs due to 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…

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…

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 a mathematical analysis of the Wang-Landau algorithm, prove its convergence, identify sources of errors and strategies for optimization. In particular, we found the histogram increases uniformly with small fluctuation after a…