Population Monte Carlo algorithms
Yukito IBA
Abstract
We give a cross-disciplinary survey on ``population'' Monte Carlo algorithms. In these algorithms, a set of ``walkers'' or ``particles'' is used as a representation of a high-dimensional vector. The computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by lots of different terms -- ``quantum Monte Carlo'', ``transfer-matrix Monte Carlo'', ``Monte Carlo filter (particle filter)'',``sequential Monte Carlo'' and ``PERM'' etc. Here we discuss them in a coherent framework. We also touch on related algorithms -- genetic algorithms and annealed importance sampling.
Create a lesson
Related papers
Global Minima of the Thomson Problem in a Disk: A Molecular Dynamics Approach with Fixed Border Charges
Georgiy K. Lavrov, Eduard G. Nikonov
Martingale theory for heat and phase-space contraction in heterogeneous diffusions
Jing Qin, Nariya Uchida, Édgar Roldán
Formal Fluctuation-Response Relations for Non-Stationary Systems: The Dynamic Conjugate Variable
Igor M. Sokolov
Khinchin's ergodicity and typicality in statistical mechanics
Dario Lucente, Marco Baldovin, Giacomo Gradenigo et al.
Universal 1/f Noise in the Power Spectra of Energy Time-series in Solvated DNA Dynamics
Harsh Sahu, Deepika Sardana, Pramod Kumar et al.
Landau diamagnetism and the de Haas-van Alphen effect from a single geometric construction
Sung-Hoon Lee