Stability of Feynman-Kac formulae with path-dependent potentials

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-562860

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.