Related papers: Flat histogram PERM
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…
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 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 demonstrate that the recently proposed pruned-enriched Rosenbluth method PERM (P.~Grassberger, Phys.~Rev.~{\bf E 56} (1997) 3682) leads to very efficient algorithms for the folding of simple model proteins. We test it on several models…
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…
An improved version of the pruned-enriched-Rosenbluth method (PERM) is proposed and tested on finding lowest energy states in simple models of lattice heteropolymers. It is found to outperform not only the previous version of PERM, but also…
We describe a general strategy, PERM (Pruned-Enriched Rosenbluth Method), for sampling configurations from a given Gibbs-Boltzmann distribution. The method is not based on the Metropolis concept of establishing a Markov process whose…
Two improved versions of the pruned-enriched-Rosenbluth method (PERM) are proposed and tested on simple models of lattice heteropolymers. Both are found to outperform not only the previous version of PERM, but also all other stochastic…
We present improved simulations of three-dimensional self avoiding walks with one end attached to an impenetrable surface on the simple cubic lattice. This surface can either be a-thermal, having thus only an entropic effect, or attractive.…
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…
We show that the classical Rosenbluth method for sampling self-avoiding walks can be extended to a general algorithm for sampling many families of objects, including self-avoiding polygons. The implementation relies on an elementary move…
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 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…
The conformational properties of flexible polymers in d dimensions in environments with extended defects are analyzed both analytically and numerically. We consider the case, when structural defects are correlated in \varepsilon_d…
We study numerically a lattice model of semiflexible homopolymers with nearest neighbor attraction and energetic preference for straight joints between bonded monomers. For this we use a new algorithm, the "Pruned-Enriched Rosenbluth…
We study the conformational properties of heteropolymers containing two types of monomers A and B, modeled as self-avoiding random walks on a regular lattice. Such a model can describe in particular the sequences of hydrophobic and…
We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight $\omega_l$ is assigned to each $(l+1)$-fold visited lattice site,…
We develop and implement a parallel flatPERM algorithm \cite{G97,PK04} with mutually interacting parallel flatPERM sequences and use it to sample self-avoiding walks in 2 and 3 dimensions. Our data show that the parallel implementation…
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…
A polymer chain containing $N$ monomers confined in a finite cylindrical tube of diameter $D$ grafted at a distance $L$ from the open end of the tube may undergo a rather abrupt transition, where part of the chain escapes from the tube to…