相关论文: An improved Rosenbluth Monte Carlo scheme for clus…
We present Monte Carlo simulations of lattice models of polymers. These simulations are intended to demonstrate the strengths of a powerful new flat histogram algorithm which is obtained by adding microcanonical reweighting techniques to…
We demonstrate that the recently proposed pruned-enriched Rosenbluth method (P. Grassberger, Phys. Rev. E 56 (1997) 3682) leads to extremely efficient algorithms for the folding of simple model proteins. We test them on several models for…
We present an implementation of Redelemeier's algorithm for the enumeration of lattice animals in high dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter…
Due to the complex characteristics of bottle-brush polymers, it became a challenge to develop an efficient algorithm for studying such macromolecules under various solvent conditions or some constraints in the space by using computer…
The scaling behaviour of randomly branched polymers in a good solvent is studied in two to nine dimensions, using as microscopic models lattice animals and lattice trees on simple hypercubic lattices. As a stochastic sampling method we use…
In this review, we describe applications of the pruned-enriched Rosenbluth method (PERM), a sequential Monte Carlo algorithm with resampling, to various problems in polymer physics. PERM produces samples according to any given prescribed…
We provide an extension to lattice systems of the reptation quantum Monte Carlo algorithm, originally devised for continuous Hamiltonians. For systems affected by the sign problem, a method to systematically improve upon the so-called…
The reptation Monte Carlo algorithm is a simple, physically motivated and efficient method for equilibrating semi-dilute solutions of linear polymers. Here we propose two simple generalizations for the analogue {\it Amoeba} algorithm for…
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling of extreme configurations of polymers in simple lattice models as a motivation. We shall show how a series of clever enhancements to a…
We discuss uniform sampling algorithms that are based on stochastic growth methods, using sampling of extreme configurations of polymers in simple lattice models as a motivation. We shall show how a series of clever enhancements to a…
Bridging algorithms are global Monte Carlo moves which allow for an efficient sampling of single polymer chains. In this manuscript we discuss the adaptation of three bridging algorithms from lattice to continuum models, and give details on…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
We present a Monte Carlo algorithm that provides efficient and unbiased sampling of polymer melts consisting of two chains of equal length that jointly visit all the sites of a cubic lattice with rod geometry L x L x rL and non-periodic…
We demonstrate that the recently proposed pruned-enriched Rosenbluth method PERM (P. Grassberger, Phys. Rev. E, in press (1997)) leads to extremely efficient algorithms for the folding of simple model proteins. We test it on several models…
We present a new Monte Carlo scheme for the efficient simulation of multi-polymer systems. The method permits chains to be inserted into the system using a biased growth technique. The growth proceeds via the use of a retractable feeler,…
This project investigates the applicability of quasi-Monte Carlo methods to Euclidean lattice systems in order to improve the asymptotic error scaling of observables for such theories. The error of an observable calculated by averaging over…
We perform numerical simulations of the lattice-animal problem at the upper critical dimension d=8 on hypercubic lattices in order to investigate logarithmic corrections to scaling there. Our stochastic sampling method is based on the…
Arrays of Rydberg atoms are a powerful platform to realize strongly-interacting quantum many-body systems. A common Rydberg Hamiltonian is free of the sign problem, meaning that its equilibrium properties are amenable to efficient…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
We develop the hybrid Monte Carlo method for simulations of single off-lattice polymer chains. We discuss implementation and choice of simulation parameters in some detail. The performance of the algorithm is tested on models for…