Mathematics – Probability
Scientific paper
2009-10-26
Mathematics
Probability
Scientific paper
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.
Chopin Nicolas
Moral Pierre Del
Rubenthaler Sylvain
No associations
LandOfFree
Stability of Feynman-Kac formulae with path-dependent potentials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Stability of Feynman-Kac formulae with path-dependent potentials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of Feynman-Kac formulae with path-dependent potentials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-562860