A new monte carlo algorithm for growing compact Self Avoiding Walks

Details A new monte carlo algorithm for growing compact Self Avoiding Walks A new monte carlo algorithm for growing compact Self Avoiding Walks

2001-08-06

arxiv.org/abs/cond-mat/0108097v4

Physics

Condensed Matter

Statistical Mechanics

RevTex file; six figures and four pages text

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A new monte carlo algorithm for growing compact Self Avoiding Walks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new monte carlo algorithm for growing compact Self Avoiding Walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new monte carlo algorithm for growing compact Self Avoiding Walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270718