Skip to Main content Skip to Navigation

A sequential particle algorithm that keeps the particle system alive

François Le Gland 1 Nadia Oudjane 2, 3
1 ASPI - Applications of interacting particle systems to statistics
UR1 - Université de Rennes 1, Inria Rennes – Bretagne Atlantique , CNRS - Centre National de la Recherche Scientifique : UMR6074
Abstract : A sequential particle algorithm proposed by Oudjane (2000) is studied here, which uses an adaptive random number of particles at each generation and guarantees that the particle system never dies out. This algorithm is especially useful for approximating a nonlinear (normalized) Feynman-Kac flow, in the special case where the selection functions can take the zero value, e.g. in the simulation of a rare event using an importance splitting approach. Among other results, a central limit theorem is proved by induction, based on the result of Rényi (1957) for sums of a random number of independent random variables. An alternate proof is also given, based on an original central limit theorem for triangular arrays of martingale increments spread across generations with different random sizes.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Anne Jaigu <>
Submitted on : Friday, February 3, 2006 - 3:57:48 PM
Last modification on : Tuesday, October 20, 2020 - 3:56:20 PM
Long-term archiving on: : Saturday, April 3, 2010 - 10:08:13 PM


  • HAL Id : inria-00001090, version 1


François Le Gland, Nadia Oudjane. A sequential particle algorithm that keeps the particle system alive. [Research Report] PI 1783, 2006, pp.35. ⟨inria-00001090⟩



Record views


Files downloads