A new monte carlo algorithm for growing compact Self Avoiding Walks
classification
❄️ cond-mat.stat-mech
q-bio
keywords
algorithmavoidingcompactconfigurationsgrowinggrowthselftemperature
read the original abstract
We propose an algorithm based on local growth rules for kinetically generating self avoiding walk configurations at any given temperature. This algorithm, called the Interacting Growth Walk (IGW) algorithm, does not suffer from attrition on a square lattice at zero temperature, in contrast to the existing algorithms. More importantly, the IGW algorithm facilitates growing compact configurations at lower temperatures - a feature that makes it attractive for studying a variety of processes such as the folding of proteins. We demonstrate that our algorithm correctly describes the collapse transition of a homopolymer in two dimensions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.