Go with the Winners: a General Monte Carlo Strategy

Preprint

17 January 2002

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0201313

Abstract

We describe a general strategy for sampling configurations from a given distribution, NOT based on the standard Metropolis (Markov chain) strategy. It uses the fact that nontrivial problems in statistical physics are high dimensional and often close to Markovian. Therefore, configurations are built up in many, usually biased, steps. Due to the bias, each configuration carries its weight which changes at every step. If the bias is close to optimal, all weights are similar and importance sampling is perfect. If not, ``population control" is applied by cloning/killing partial configurations with too high/low weight. This is done such that the final (weighted) distribution is unbiased. We apply this method (which is also closely related to diffusion type quantum Monte Carlo) to several problems of polymer statistics, reaction-diffusion models, sequence alignment, and percolation.

Keywords

All Related Versions

Version 1, 2002-01-17, ArXiv
Published version: Computer Physics Communications, 147 (1-2), 64.

This publication has 0 references indexed in Scilit: