Rare event sampling with stochastic growth algorithms

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 2013 Owned by the authors, published by EDP Sciences.

Cite

CITATION STYLE

APA

Prellberg, T. (2013). Rare event sampling with stochastic growth algorithms. In EPJ Web of Conferences (Vol. 44). https://doi.org/10.1051/epjconf/20134401001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free