arXiv · cond-mat/0108097
A new monte carlo algorithm for growing compact Self Avoiding Walks
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.
Explore related subjects
Keep this discovery
S. L. Narasimhan, P. S. R. Krishna, K. P. N. Murthy, M. Ramanadham. 2001-08-27. A new monte carlo algorithm for growing compact Self Avoiding Walks. https://arxiv.org/abs/cond-mat/0108097
Cite the original work for its findings. Save a collection to share your selection of sources.