A simple proof of Kaijser's unique ergodicity result for hidden Markov α-chains
Fred Kochman, Jim Reeds
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 α-chain has a unique invariant limiting measure λ. Here the α-chain \αn\=\(αni)\ is given by \[αni=P(Xn=i| Yn,Yn-1,...),\] where \(Xn,Yn)\ is a finite state HMM with unobserved Markov chain component \Xn\ and observed output component \Yn\. This defines \αn\ as a stochastic process taking values in the probability simplex. It is not hard to see that \αn\ is itself a Markov chain. The stepping matrices M(y)=(M(y)ij) give the probability that (Xn,Yn)=(j,y), conditional on Xn-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(Y1)M(Y2)... M(Yn). In this paper we prove a slightly stronger form of Kaijser's theorem with a simpler argument, exploiting the theory of e chains.
Create a lesson
Related papers
Boolean Small-Ball Inequalities for Discrepancy Theory
Emrullah Akbas, Suvrit Sra
Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior
Arthur Blanc-Renaudie
Point process convergence of large inradii of Poisson-Laguerre tessellations
Matthias Schulte, Martina Švarc Petráková
Interpolation of Gaussian Free Fields via Random Matrices
Gabriel Raposo
Almost-Uniform Bayesian Convergence to the Truth Is Not Characterized by Countable Additivity on Conditional Hitting Times
M. Ali Khan, Arthur Paul Pedersen, Maxwell B. Stinchcombe
The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence
Marc Bernard, Robin Stephenson