相关论文: Rejection-free cluster Wang-Landau algorithm for h…

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…

Critical properties of lattice gases with nearest-neighbor exclusion are investigated via the adaptive-window Wang-Landau algorithm on the square and simple cubic lattices, for which the model is known to exhibit an Ising-like phase…

Triangulations are important objects of study in combinatorics, finite element simulations and quantum gravity, where its entropy is crucial for many physical properties. Due to their inherent complex topological structure even the number…

Hard core lattice gas models are minimal models to study entropy driven phase transitions. In the $k$-NN lattice gas, a particle excludes all sites upto the $k$-th next-nearest neighbors from being occupied by another particle. As $k$…

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

We obtain the phase diagram of the hard core lattice gas with third nearest neighbor exclusion on the triangular lattice using Monte Carlo simulations that are based on a rejection-free flat histogram algorithm. In a recent paper [J. Chem.…

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…

Coarse-grained (lattice-) models have a long tradition in aiding efforts to decipher the physical or biological complexity of proteins. Despite the simplicity of these models, however, numerical simulations are often computationally very…

We study a family of lattice-gas systems defined on semiregular grids, obtained by projecting the vertices of three different geodesic icosahedra onto a spherical surface. By using couplings up to third neighbors we explore various…

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…

Highly size-asymmetrical fluid mixtures arise in a variety of physical contexts, notably in suspensions of colloidal particles to which much smaller particles have been added in the form of polymers or nanoparticles. Conventional schemes…

We formulate a Swendsen-Wang-like version of the geometric cluster algorithm. As an application,we study the hard-core lattice gas on the triangular lattice with the first- and the second-neighbor exclusions. The data are analyzed by…

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 study a lattice-gas model of penetrable particles on a square-lattice substrate with same-site and nearest-neighbor interactions. Penetrability implies that the number of particles occupying a single lattice site is unlimited and the…

We put forward a general procedure to obtain an approximate free energy density functional for any hard-core lattice gas, regardless of the shape of the particles, the underlying lattice or the dimension of the system. The procedure is…

We demonstrate the use of a new algorithm called the Flat Histogram sampling algorithm for the simulation of lattice polymer systems. Thermodynamics properties, such as average energy or entropy and other physical quantities such as…

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…

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 report a numerical study of self-avoiding polymers on the square lattice, including an attractive potential between nonconsecutive monomers. Using Wang-Landau sampling (WLS) with adaptive windows, we obtain the density of states for…