pith. sign in

arxiv: 1209.2186 · v1 · pith:ZENOSMQDnew · submitted 2012-09-11 · ❄️ cond-mat.stat-mech

Rare event sampling with stochastic growth algorithms

classification ❄️ cond-mat.stat-mech
keywords samplingalgorithmsalgorithmgrowthmodelspolymersstochasticuniform
0
0 comments X
read the original abstract

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.

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.