Abstract
This paper presents a general strong limit theorem for delayed sum of functions of random variables for a hidden time inhomogeneous Markov chain (HTIMC), and as corollaries, some strong laws of large numbers for HTIMC are established thereby.
Keywords: Inhomogeneous hidden Markov chain, Delayed sum, Law of large numbers
Introduction
Hidden Markov chain is an important branch of Markov chain theory. A classical hidden Markov model was first introduced by Baum and Petrie [1]. It provides a flexible model that is very useful in different areas of applied probability and statistics. Examples are found in machine recognition, like speech and optical character recognition, and bioinformatics. The power of these models is that they can be very efficiently implemented and simulated. In recent years, many new theories were introduced into hidden time inhomogeneous Markov chain (HTIMC) theory. G.Q. Yang et al. [2] gave a law of large numbers for countable hidden time inhomogeneous Markov models. In addition, delayed sums of random variables were first discussed by Zygmund [3]. Gut and Stradtmüller [4] studied the strong law of large numbers for delayed sums of random fields. Wang and Yang [5] studied the generalized entropy ergodic theorem with a.e. and convergence for time inhomogeneous Markov chains. Wang [6, 7] discussed the limit theorems of delayed sums for row-wise conditionally independent stochastic arrays and a class of asymptotic properties of moving averages for Markov chains in Markovian environments.
In the classical studies there are two simplest models for predicting: the mean model and the random walk model [8]. These two models use all the historical information. But we often encounter time series that appear to be “locally stationary”, so we can take an average of what has happened in some window of the recent past. Based on this idea and the above researches, the main focus of this paper is to obtain a general strong limit theorem of delayed sums of functions of random variables for an HTIMC, and as corollaries, some strong laws of large numbers for HTIMC are established thereby.
The remainder of this paper is organized as follows: Sect. 2 gives a brief description of the HTIMC and related lemmas. Section 3 presents the main results and the proofs.
Preliminaries
In this section we list some fundamental definitions and related results that are needed in the next section.
Let be the underling probability space and a random vector, where and are two different stochastic processes, η is hidden (η takes values in set ) and ξ is observable (ξ takes values in set ).
We first recall the definition of a hidden time inhomogeneous Markov chain (HTIMC) with hidden chain and observable process .
Definition 1
The process is called an HTIMC if it follows the following form and conditions:
- Suppose that a given time inhomogeneous Markov chain takes values in state space , its starting distribution is
and transition matrices are2.1
where2.2 - For any positive integer n,
2.3
Some necessary and sufficient conditions for (2.3) have been given by G.Q. Yang et al. [2].
- (2.3) holds if, for any n,
holds.2.4 - is a hidden time inhomogeneous Markov chain if and only if ,
2.5 - is a hidden time inhomogeneous Markov chain if and only if ,
2.6 2.7
Let be two sequences of nonnegative integers with converging to infinity as . Let , , , , be the number of ordered couples in , with among and among , respectively.
It is easy to verify that
| 2.8 |
| 2.9 |
and
| 2.10 |
where denotes the indicator function of set A.
Lemma 1
Let be an HTIMC which takes values in , let be a sequence of functions on , let , and let be a sequence of pairs of positive integers with , where is arbitrary. Define
| 2.11 |
Then
| 2.12 |
Proof
Let λ be a real number. We first define
| 2.13 |
Note that
and
Hence, we have
It is easy to show that ; . This and the Markov inequality imply that, for every ,
Hence
which, by the first Borel–Cantelli Lemma, allows us to conclude that a.s., since ε is arbitrary, thus
| 2.14 |
follows since (). We have by Eqs. (2.13) and (2.14) that
| 2.15 |
Taking , and dividing both sides of Eq. (2.15) by λ, we get
| 2.16 |
We have by Eq. (2.16) and inequalities (), that
| 2.17 |
Letting in Eq. (2.17), we get
| 2.18 |
Taking , similarly, we have
Putting , we have
| 2.19 |
From Eqs. (2.18) and (2.19), we obtain
Thus we complete the proof of Lemma 1. □
Lemma 2
Assume that is an HTIMC defined as in Lemma 1. Then, for every ; ,
| 2.20 |
Proof
From definition of Hidden Markov chain, we have, for every , , ; ,
![]() |
Hence, we have
![]() |
□
According to Theorem 1 of Wang [5], it is easy to verify the following lemma.
Lemma 3
Suppose that is a time inhomogeneous Markov chain which takes value in state space , its starting distribution is
| 2.21 |
and transition matrices are
| 2.22 |
where
Assume that , , is another transition matrix which satisfies the following condition:
| 2.23 |
Then, for each ,
| 2.24 |
where is the stationary distribution determined by Π.
Main results
Theorem 1
Let be an HTIMC which takes values in , be a function on .
Let , , be another transition matrix and be conditional probabilities which satisfy
| 3.1 |
| 3.2 |
If the transition matrix Π has a stationary distribution , then
| 3.3 |
Proof
Since is bounded, we have by Lemmas 1 and 2 that
| 3.4 |
Observe that
We have that, by Eq. (3.4),
Therefore Eq. (3.3) holds. □
Corollary 1
Under the conditions of Theorem 1, we have for each , ,
| 3.5 |
Proof
Put , in Theorem 1. Then
□
Corollary 2
Under the assumptions of Theorem 1, we have, for each , ,
| 3.6 |
Proof
Put , in Theorem 1. Then
□
Authors’ contributions
All authors carried out the proof. All authors conceived of the study, and participated in its design and coordination. All authors read and approved the final manuscript.
Funding
This research is supported in part by the RP of AnHui Provincial Department of Education (KJ2017A851, KJ2017A547).
Competing interests
The authors declare that they have no competing interests.
Footnotes
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Contributor Information
Yun Dong, Email: 405388629@qq.com.
Fang-qing Ding, Email: dfq@hfuu.edu.cn.
Qi-feng Yao, Email: 3192152730@qq.com.
References
- 1.Baum L.E., Petrie T. Statistical inference for probabilistic functions of finite state Markov chains. Ann. Math. Stat. 1966;37:1554–1563. doi: 10.1214/aoms/1177699147. [DOI] [Google Scholar]
- 2.Yang G.Q., Yang W.G., Wu X.T. The strong laws of large numbers for countable nonhomogeneous hidden Markov models. Commun. Stat., Theory Methods. 2017;46(17):8808–8819. doi: 10.1080/03610926.2016.1193203. [DOI] [Google Scholar]
- 3.Zygmund A. Trigonometric Series. New York: Cambridge University Press; 1959. [Google Scholar]
- 4.Gut A., Stradtmüller U. On the strong law of large numbers for delayed sums and random fields. Acta Math. Hung. 2010;129(1–2):182–203. doi: 10.1007/s10474-010-9272-x. [DOI] [Google Scholar]
- 5.Wang Z.Z., Yang W.G. The generalized entropy ergodic theorem for nonhomogeneous Markov chains. J. Theor. Probab. 2016;29:761–775. doi: 10.1007/s10959-015-0597-9. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 6.Wang Z.Z. A kind of asymptotic properties of moving averages for Markov chains in Markovian environments. Commun. Stat., Theory Methods. 2017;46(22):10926–10942. doi: 10.1080/03610926.2016.1257720. [DOI] [Google Scholar]
- 7.Wang Z.Z. Some limit theorems of delayed sums for row-wise conditionally independent stochastic arrays. Commun. Stat., Theory Methods. 2017;46(11):5265–5272. doi: 10.1080/03610926.2015.1099674. [DOI] [Google Scholar]
- 8.Isaacson D., Madsen R. Markov Chains Theory and Applications. New York: Wiley; 1976. [Google Scholar]


