相关论文: Performance of Wang-Landau algorithm in continuous…

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

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…

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 consider a class of systems where $N$ identical particles with positions ${\bf q}_1,...,{\bf q}_N$ and momenta ${\bf p}_1,...,{\bf p}_N$ are enclosed in a box of size $L$, and exhibit the scaling $\mathcal{U}(L{\bf r}_1,...,L{\bf…

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

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…

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…

In this communication, the convergence of the 1/t and Wang - Landau algorithms in the calculation of multidimensional numerical integrals is analyzed. Both simulation methods are applied to a wide variety of integrals without restrictions…

We determine the optimal scaling of local-update flat-histogram methods with system size by using a perfect flat-histogram scheme based on the exact density of states of 2D Ising models.The typical tunneling time needed to sample the entire…

Monte Carlo simulation has been performed in one-dimensional Lebwohl-Lasher model and two dimensional XY-model using the Wang-Landau and the Wang-Landau-Transition-Matrix Monte Carlo methods. Random walk has been performed in the…

Combining traditional Wang-Landau sampling for multiple replica systems with an exchange of densities of states between replicas, we describe a general framework for simulations on massively parallel Petaflop supercomputers. The advantages…

In this short note, we show how the parallel adaptive Wang-Landau (PAWL) algorithm of Bornn et al. (2013) can be used to automate and improve simulated tempering algorithms. While Wang-Landau and other stochastic approximation methods have…

We investigate a generic, parallel replica-exchange framework for Monte Carlo simulations based on the Wang-Landau method. To demonstrate its advantages and general applicability for massively parallel simulations of complex systems, we…

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…

We introduce a parallel Wang-Landau method based on the replica-exchange framework for Monte Carlo simulations. To demonstrate its advantages and general applicability for simulations of complex systems, we apply it to different spin models…