相关论文: Avoiding Boundary Effects in Wang-Landau Sampling

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

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…

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

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…

The multiple range random walk algorithm recently proposed by Wang and Landau [Phys. Rev. Lett. 86, 2050 (2001)] is adapted to the computation of free energy profiles for molecular systems along reaction coordinates. More generally, we show…

It is shown in this work how the Wang-Landau algorithm can be parallelized through the concept of the micromagnetic ensemble, when the Hamiltonian contains both spin interaction and the external field terms, and thus energy-magnetization…

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…

We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…

We propose a strategy to achieve the fastest convergence in the Wang-Landau algorithm with varying modification factors. With this strategy, the convergence of a simulation is at least as good as the conventional Monte Carlo algorithm, i.e.…

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

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…

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…

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…

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…

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…

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…

We propose a method based on the Wang-Landau algorithm to numerically generate the spectral densities of random matrix ensembles. The method employs Dyson's log-gas formalism for random matrix eigenvalues and also enables one to…