相关论文: The Wang-Landau algorithm reaches the flat histogr…

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…

As far as we know, there is no flat-histogram algorithm to sample the stationary distribution of non-equilibrium stochastic processes. The present work addresses this gap by introducing a generalization of the Wang-Landau algorithm, applied…

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…

We provide analysis of the convergence properties and applicability extensions of flat-histogram algorithms, with a particular focus on the Wang-Landau algorithms (exemplified by converging stochastic approximation Monte Carlo (SAMC)) and…

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 show that the Wang-Landau algorithm can be formulated as a stochastic gradient descent algorithm minimizing a smooth and convex objective function, of which the gradient is estimated using Markov chain Monte Carlo iterations. 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…

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

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

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…

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…

When performing a Monte Carlo calculation, the running time should in principle be much longer than the autocorrelation time in order to get reliable results. Among different lattice fermion models, the Holstein model is notorious for its…

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…

Performance of Wang-Landau (W-L) algorithm in two continuous spin models is tested by determining the fluctuations in energy histogram. Finite size scaling is performed on a modified XY-model using different W-L sampling schemes.…

A simple modification of the ``Wang-Landau sampling'' algorithm removes the systematic error that occurs at the boundary of the range of energy over which the random walk takes place in the original algorithm.

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…

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…