Exponential forgetting and geometric ergodicity in hidden Markov models

From MaRDI portal
Publication:1975240





This paper considers a hidden Markov model with multidimensional observations, and with misspecification, i.e., the assumed coefficients (transition probability matrix and observation conditional densities) are possibly different from the true coefficients. Under mild assumptions on the coefficients of both the true and the assumed models, it is proved that: (i) the prediction filter, and its gradient with respect to some parameter in the model, forget almost surely their initial condition exponentially fast, and (ii) the extended Markov chain, whose components are the unobserved Markov chain, the observation sequence, the prediction filter, and its gradient, is geometrically ergodic and has a unique invariant probability distribution.




Cited in
(55)








This page was built for publication: Exponential forgetting and geometric ergodicity in hidden Markov models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975240)