Stability of Feynman-Kac formulae with path-dependent potentials

Abstract : Several particle algorithms admit a Feynman-Kac representation such that the potential function may be expressed as a recursive function which depends on the complete state trajectory. An important example is the mixture Kalman filter, but other models and algorithms of practical interest fall in this category. We study the asymptotic stability of such particle algorithms as time goes to infinity. As a corollary, practical conditions for the stability of the mixture Kalman filter, and a mixture GARCH filter, are derived. Finally, we show that our results can also lead to weaker conditions for the stability of standard particle algorithms, such that the potential function depends on the last state only.
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00426415
Contributor : Nicolas Chopin <>
Submitted on : Monday, October 26, 2009 - 11:45:49 AM
Last modification on : Tuesday, April 2, 2019 - 2:25:05 AM
Document(s) archivé(s) le : Thursday, June 17, 2010 - 6:03:02 PM

Files

mk.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00426415, version 1
  • ARXIV : 0910.4870

Citation

Nicolas Chopin, Pierre Del Moral, Sylvain Rubenthaler. Stability of Feynman-Kac formulae with path-dependent potentials. 2009. ⟨hal-00426415⟩

Share

Metrics

Record views

917

Files downloads

205