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

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…

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

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

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

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

We adapted the SWAP molecular dynamics algorithm for use in lattice Ising spin models. We dressed the spins with a randomly distributed length and we alternated long-range spin exchanges with conventional single spin flip Monte Carlo…

When simulating a lattice system near its critical temperature, local algorithms for modeling the system's evolution can introduce very large autocorrelation times into sampled data. This critical slowing down places restrictions on the…

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 analyze the efficiency of the Wang-Landau algorithm to sample a multimodal distribution on a prototypical simple test case. We show that the exit time from a metastable state is much smaller for the Wang Landau dynamics than for the…

A spin dynamics algorithm, combining checkerboard updating and a rotation algorithm based on the local second-rank ordering field, is developed for the Lebwohl-Lasher model of liquid crystals. The method is shown to conserve energy well and…

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…

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…

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…

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…

Flat histogram methods, such as Wang--Landau sampling, provide a means for high-throughput calculation of phase diagrams of atomistic/lattice model systems. Many parallelisation schemes with varying degrees of complexity have been proposed…

Monte Carlo simulations using Wang-Landau sampling are performed to study three-dimensional chains of homopolymers on a lattice. We confirm the accuracy of the method by calculating the thermodynamic properties of this system. Our results…

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…