Related papers: Wang-Landau sampling in three-dimensional polymers
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an…
We study the ground-state properties of trapped inhomogeneous systems of hardcore bosons in two- and three-dimensional lattices. We obtain our results both numerically, using quantum Monte Carlo techniques, and via several analytical…
We construct an effective low-energy Hamiltonian from the classical action via Monte Carlo with importance sampling. We use Monte Carlo (i) to compute matrix elements of the transition amplitude and (ii) to construct stochastically a basis.…
Monte Carlo methods represent the "de facto" standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use…
Monte Carlo methods are widely used to estimate observables in many-body quantum systems. However, conventional sampling schemes often require a large number of samples to achieve sufficient accuracy. In this work we propose the…
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.…
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 behaviour of the one--dimensional random--forced Burgers equation is investigated in the path integral formalism, using a discrete space--time lattice. We show that by means of Monte Carlo methods one may evaluate observables, such as…
A $\theta$ term, which couples to topological charge, is added to the two-dimensional lattice CP^3 model and U(1) gauge theory. Monte Carlo simulations are performed and compared to strong-coupling character expansions. In certain…
We present a temperature-independent Monte Carlo method for the determination of the density of states of lattice proteins that combines the fast ground-state search strategy of the nPERM chain growth and multicanonical reweighting for…
The Cooperative Motion Algorithm is an efficient lattice method to simulate dense polymer systems and is often used with two different criteria to generate a Markov chain in the configuration space. While the first method is the…
An off-lattice Monte Carlo algorithm for solutions of equilibrium polymers (EP) is proposed. At low and moderate densities this is shown to reproduce faithfully the (static) properties found recently for flexible linear EP using a lattice…
We show direct formal relationship between the Wang-Landau iteration [PRL 86, 2050 (2001)], metadynamics [PNAS 99, 12562 (2002)] and statistical temperature molecular dynamics [PRL 97, 050601 (2006)], the major Monte Carlo and molecular…
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements,…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
We present an efficient Monte-Carlo method for long-range interacting systems to calculate free energy as a function of an order parameter. In this method, a variant of the Wang-Landau method regarding the order parameter is combined with…
Importance sampling is a Monte Carlo method which designs estimators of expectations under a target distribution using weighted samples from a proposal distribution. When the target distribution is complex, such as multimodal distributions…
The basic idea of fast Monte Carlo (MC) simulations is to perform particle-based MC simulations with the excluded-volume interactions modeled by "soft" repulsive potentials that allow particle overlapping. This gives much faster system…
We use a Monte Carlo simulation to study the diluted antiferromagnetic Ising model on the frustrated lattices including the pyrochlore lattice to show the dilution effects. Using the Wang-Landau algorithm, which directly calculates the…
A brief introduction to the technique of Monte Carlo simulations in statistical physics is presented. The topics covered include statistical ensembles random and pseudo random numbers, random sampling techniques, importance sampling, Markov…