Related papers: Rejection-free cluster Wang-Landau algorithm for h…
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…
The $k$-NN hard core lattice gas model on a square lattice, in which the first $k$ next nearest neighbor sites of a particle are excluded from being occupied by another particle, is the lattice version of the hard disc model in two…
In this paper, we present a cluster algorithm for the numerical simulations of non-additive hard-core mixtures. This algorithm allows one to simulate and equilibrate systems with a number of particles two orders of magnitude larger than…
Dynamical quantum-cluster approaches, such as different cluster extensions of the dynamical mean-field theory (cluster DMFT) or the variational cluster approximation (VCA), combined with efficient cluster solvers, such as the quantum…
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 consider a lattice gas in spaces of dimensionality $\mathcal{D}=1,2,3$. The particles are subject to a hardcore exclusion interaction and an attractive pair interaction that satisfies Gauss' law as do Newtonian gravity in…
We use an extension of fundamental measure theory to lattice hard-core fluids to study the phase diagram of two different systems. First, two-dimensional parallel hard squares with edge-length $\sigma=2$ in a simple square lattice. This…
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 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…
The density of states is calculated for a SU(2) and a compact U(1) lattice gauge theory using a modified version of the Wang-Landau algorithm. We find that the density of states of the SU(2) gauge theory can be reliably calculated over a…
Soft porous crystals are flexible metal-organic frameworks that respond to physical stimuli such as temperature, pressure, and gas adsorption by large changes in their structure and unit cell volume. While they have attracted a lot of…
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 have investigated the non-equilibrium nature of a lattice gas system consisting of a regular lattice of charged particles driven by an external electric field. For a big system, an exact solution cannot be obtained using a master…
We study dynamical behaviors of one-dimensional stochastic lattice gases with repulsive interactions whose span can be arbitrary large. We endow the system with a zero-temperature dynamics, so that the hops to empty sites which would have…
We construct a density functional for the lattice gas / Ising model on square and cubic lattices based on lattice fundamental measure theory. In order to treat the nearest-neighbor attractions between the lattice gas particles, the model is…
We analyze a lattice model closely related to the one-dimensional inelastic gas with periodic boundary condition. The one-dimensional inelastic gas tends to form high density clusters of particles with almost the same velocity, separated by…
We present a new method to describe the kinetics of driven lattice gases with particle-particle interactions beyond hard-core exclusions. The method is based on the time-dependent density functional theory for lattice systems and allows one…
We presented an efficient algorithm, fast adaptive flat-histogram ensemble (FAFE), to estimate the density of states (DOS) and to enhance sampling in large systems. FAFE calculates the means of an arbitrary extensive variable $U$ in…
In this paper, we demonstrate the efficiency of simulations via direct computation of the partition function under various macroscopic conditions, such as different temperatures or volumes. The method can compute partition functions by…
We apply the Linear Logarithmic Relaxation (LLR) method, which generalizes the Wang-Landau algorithm to quantum systems with continuous degrees of freedom, to the fermionic Hubbard model with repulsive interactions on the honeycomb lattice.…