A new monte carlo algorithm for growing compact Self Avoiding Walks
| dc.creator | Narasimhan, S. L. | |
| dc.creator | Krishna, P. S. R. | |
| dc.creator | Murthy, K. P. N. | |
| dc.creator | Ramanadham, M. | |
| dc.date | 2001-08-06 | |
| dc.date | 2001-08-27 | |
| dc.date.accessioned | 2026-07-25T14:27:54Z | |
| dc.description | 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. | |
| dc.description | RevTex file; six figures and four pages text | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0108097 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0108097 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/25886 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Quantitative Biology | |
| dc.title | A new monte carlo algorithm for growing compact Self Avoiding Walks | |
| dc.type | text |