Rare event sampling with stochastic growth algorithms
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 fifty-odd year old algorithm, the Rosenbluth method, led to a cutt...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2013-03-01
|
Series: | EPJ Web of Conferences |
Online Access: | http://dx.doi.org/10.1051/epjconf/20134401001 |
Summary: | 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 fifty-odd year old algorithm, the Rosenbluth method, led to a cutting-edge algorithm capable of uniform sampling of equilibrium statistical mechanical systems of polymers in situations where competing algorithms failed to perform well. Examples range from collapsed homo-polymers near sticky surfaces to models of protein folding. |
---|---|
ISSN: | 2100-014X |