A simple proof of Kaijser's unique ergodicity result for hidden Markov -chains

DOI10.1214/105051606000000367zbMATH Open1121.60077arXivmath/0702248OpenAlexW1969476627MaRDI QIDQ997404FDOQ997404

Fred Kochman, James A. Reeds

Publication date: 6 August 2007

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: According to a 1975 result of T. Kaijser, if some nonvanishing product of hidden Markov model (HMM) stepping matrices is subrectangular, and the underlying chain is aperiodic, the corresponding $alpha$-chain has a unique invariant limiting measure $lambda$. Here the $alpha$-chain $alph{a}_n=(alph{a}_{ni})$ is given by [alpha_{ni}=P(X_n=i| Y_n,Y_{n-1},...),] where $(X_n,Y_n)$ is a finite state HMM with unobserved Markov chain component $X_n$ and observed output component $Y_n$. This defines $alph{a}_n$ as a stochastic process taking values in the probability simplex. It is not hard to see that $alph{a}_n$ is itself a Markov chain. The stepping matrices $M(y)=(M(y{)}_{ij})$ give the probability that $(X_n,Y_n)=(j,y)$, conditional on $X_{n-1}=i$. A matrix is said to be subrectangular if the locations of its nonzero entries forms a cartesian product of a set of row indices and a set of column indices. Kaijser's result is based on an application of the Furstenberg--Kesten theory to the random matrix products $M(Y_1)M(Y_2)\mathrm{...}M(Y_n)$. In this paper we prove a slightly stronger form of Kaijser's theorem with a simpler argument, exploiting the theory of e chains.

Full work available at URL: https://arxiv.org/abs/math/0702248

Recommendations

• A complete solution to Blackwell's unique ergodicity problem for hidden Markov chains
• Ergodicity of hidden Markov models
• Hidden Markov processes
• The complete realization problem for hidden Markov models: a survey and some new results
• A Compact Framework for Hidden Markov Chains with Applications to Fractal Geometry

zbMATH Keywords

ergodicityhidden Markov modelsuniform mean stabilitye-chain

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Discrete-time Markov processes on general state spaces (60J05) Limit theorems in probability theory (60F99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Markov chains and stochastic stability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sur des chaînes à liaisons complètes
• Invariant measures for Markov processes arising from iterated function systems with place-dependent probabilities
• Products of Random Matrices
• Title not available (Why is that?)
• A limit theorem for partially observed Markov chains

Cited In (7)

• Effects of statistical dependence on multiple testing under a hidden Markov model
• Long Run Control with Degenerate Observation
• A complete solution to Blackwell's unique ergodicity problem for hidden Markov chains
• On convergence in distribution of the Markov chain generated by the filter kernel induced by a fully dominated hidden Markov model
• Observability and nonlinear filtering
• Another look at partially observed optimal stochastic control: existence, ergodicity, and approximations without belief-reduction
• On Markov chains induced by partitioned transition probability matrices

This page was built for publication: A simple proof of Kaijser's unique ergodicity result for hidden Markov \(\alpha\)-chains

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