Exponential forgetting of smoothing distributions for pairwise Markov models

preprint2021arXivOpen access

Abstract

We consider a bivariate Markov chain Z={Zk}k≥1={(Xk,Yk)}k≥1Z=\{Z_k\}_{k \geq 1}=\{(X_k,Y_k)\}_{k \geq 1} taking values on product space Z=X×Y{\cal Z}={\cal X} \times{ \cal Y}, where X{\cal X} is possibly uncountable space and Y={1,…,∣Y∣}{\cal Y}=\{1,\ldots, |{\cal Y}|\} is a finite state-space. The purpose of the paper is to find sufficient conditions that guarantee the exponential convergence of smoothing, filtering and predictive probabilities: $$\sup_{n\geq t}\|P(Y_{t:\infty}\in \cdot|X_{l:n})-P(Y_{t:\infty}\in \cdot|X_{s:n}) \|_{\rm TV} \leq K_s α^{t}, \quad \mbox{a.s.}$$ Here t≥s≥l≥1t\geq s\geq l\geq 1, KsK_s is σ(Xs:∞)σ(X_{s:\infty})-measurable finite random variable and α∈(0,1)α\in (0,1) is fixed. In the second part of the paper, we establish two-sided versions of the above-mentioned convergence. We show that the desired convergences hold under fairly general conditions. A special case of above-mentioned very general model is popular hidden Markov model (HMM). We prove that in HMM-case, our assumptions are more general than all similar mixing-type of conditions encountered in practice, yet relatively easy to verify.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.