Skip to main content
Springer logoLink to Springer
. 2018 Oct 25;2018(1):292. doi: 10.1186/s13660-018-1884-7

Some limit properties for a hidden inhomogeneous Markov chain

Yun Dong 1,, Fang-qing Ding 2, Qi-feng Yao 3
PMCID: PMC6208614  PMID: 30839765

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 L1 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 (Ω,F,P) be the underling probability space and ζ=(ξ,η) a random vector, where ξ=(ξ0,ξ1,) and η=(η0,η1,) are two different stochastic processes, η is hidden (η takes values in set Y={ω0,ω1,,ωb}) and ξ is observable (ξ takes values in set X={θ0,θ1,,θd}).

We first recall the definition of a hidden time inhomogeneous Markov chain (HTIMC) ζ=(ξ,η)={ξn,ηn}n=0 with hidden chain {ηn}n=0 and observable process {ξn}n=0.

Definition 1

The process ζ=(ξ,η) is called an HTIMC if it follows the following form and conditions:

  1. Suppose that a given time inhomogeneous Markov chain takes values in state space Y, its starting distribution is
    (q(ω0),q(ω1);;q(ωb)),q(ωi)>0,ωiY, 2.1
    and transition matrices are
    Qk=(qk(ωjωi)),qk(ωjωi)>0,ωi,ωjY,k1, 2.2
    where
    qk(ωjωi)=P(ηk=ωjηk1=ωi),k1.
  2. For any positive integer n,
    P(ξ0=x0,,ξn=xnη)=k=0nP(ξk=xkηk)a.s. 2.3

Some necessary and sufficient conditions for (2.3) have been given by G.Q. Yang et al. [2].

  1. (2.3) holds if, for any n,
    P(ξ0=x0,,ξn=xnη0=y0,,ηn=yn)=k=0nP(ξk=xkηk=yk) 2.4
    holds.
  2. ζ=(ξ,η) is a hidden time inhomogeneous Markov chain if and only if n0,
    p(x0,y0,,xn,yn)=q(y0)k=1nqk(ykyk1)k=0npk(xkyk),n1. 2.5
  3. ζ=(ξ,η) is a hidden time inhomogeneous Markov chain if and only if n0,
    P(ηn=ynξ0=x0,,ξn1=xn1,η0=y0,,ηn1=yn1)=P(ηn=ynηn1=yn1), 2.6
    P(ξn=xnξ0=x0,,ξn=xn,η0=y0,,ηn1=yn1)=P(ξn=xnηn=yn). 2.7

Let {an,bn} be two sequences of nonnegative integers with bn converging to infinity as n. Let San,bn(θi,ωj), Wan,bn(ωi), Tan,bn(θi), θiX, ωjY be the number of ordered couples (θi,ωj) in (ξan+1,ηan+1),(ξan+2,ηan+2),,(ξan+bn,ηan+bn), with ωi among ηan+1,ηan+2,,ηan+bn and θi among ξan+1,ξan+2,,ξan+bn, respectively.

It is easy to verify that

San,bn(θi,ωj)=k=an+1an+bn1{θi}(ξk)1{ωj}(ηk), 2.8
Wan,bn(ωi)=k=an+1an+bn1{ωi}(ηk), 2.9

and

Tan,bn(θi)=k=an+1an+bn1{θi}(ξk), 2.10

where 1A() denotes the indicator function of set A.

Lemma 1

Let ζ=(ξ,η)={(ξk,ηk)}k=0 be an HTIMC which takes values in X×Y, let {fk(x,y)}k=0 be a sequence of functions on X×Y, let Fm,n=σ{(ξm,ηm,,ξn,ηn),0mnZ+}, and let {an,bn} be a sequence of pairs of positive integers with n=1exp[εbn]<, where ε>0 is arbitrary. Define

A(α)={ω:limsupn1bnk=an+1an+bnE[fk2(ξk,ηk)eα|fk(ξk,ηk)|Fan,k1]=M(α,ω)<}(α>0). 2.11

Then

limn1bnk=an+1an+bn{fk(ξk,ηk)E[fk(ξk,ηk)Fan,k1]}=0a.s. ωA(α). 2.12

Proof

Let λ be a real number. We first define

tan,bn(λ,ω)=eλk=an+1an+bnfk(ξk,ηk)k=an+1an+bnE[eλfk(ξk,ηk)Fan,k1]. 2.13

Note that

tan,bn(λ,ω)=tan,bn1(λ,ω)eλfan+bn(ξan+bn,ηan+bn)E[eλfan+bn(ξan+bn,ηan+bn)Fan,an+bn1]

and

E[tan,bn(λ,ω)]=E{E[tan,bn(λ,ω)]Fan,an+bn1}.

Hence, we have

E[tan,bn(λ,ω)Fan,an+bn1]=tan,bn1(λ,ω)a.s.

It is easy to show that E[tan,bn(λ,ω)]=1; n1. This and the Markov inequality imply that, for every ε>0,

P[1bnlogtan,bn(λ,ω)ε]=P[tan,bn(λ,ω)exp(nε)]1exp(εbn).

Hence

n=1P[1bnlogtan,bn(λ,ω)ε]n=1exp(εbn)<,

which, by the first Borel–Cantelli Lemma, allows us to conclude that limsupn1bnlogtan,bn(s,ω)<ε a.s., since ε is arbitrary, thus

limsupn1bnlogtan,bn(λ,ω)0a.s. 2.14

follows since 1bnlogn2=2lognbn0 (n). We have by Eqs. (2.13) and (2.14) that

limsupn1bn{λk=an+1an+bnfk(ξk,ηk)k=an+1an+bnlogE[eλfk(ξk,ηk)Fan,k1]}0a.s. 2.15

Taking 0<λα, and dividing both sides of Eq. (2.15) by λ, we get

limsupn1bn{k=an+1an+bnfk(ξk,ηk)k=an+1an+bnlogE[eλfk(ξk,ηk)Fan,k1]λ}0a.s. 2.16

We have by Eq. (2.16) and inequalities logxx1 (x>0), 0ex1x12x2e|x| that

limsupn1bnk=an+1an+bn{fk(ξk,ηk)E[fk(ξk,ηk)Fan,k1]}limsupn1bnk=an+1an+bn{logE[eλfk(ξk,ηk)Fan,k1]λE[fk(ξk,ηk)Fan,k1]}limsupn1bnk=an+1an+bn{E[eλfk(ξk,ηk)Fan,k1]1λE[fk(ξk,ηk)Fan,k1]}λ2limsupn1bnk=an+1an+bnE[fk2(ξk,ηk)eα|fk(ξk,ηk)|Fan,k1]=λ2M(α,ω)a.s. ωA(α). 2.17

Letting λ0+ in Eq. (2.17), we get

limsupn1bnk=an+1an+bn{fk(ξk,ηk)E[fk(ξk,ηk)Fan,k1]}0a.s. ωA(α). 2.18

Taking α<λ0, similarly, we have

liminfn1bnk=an+1an+bn{fk(ξk,ηk)E[fk(ξk,ηk)Fan,k1]}λ2M(α,ω)a.s. ωA(α).

Putting λ0, we have

liminfn1bnk=an+1an+bn{fk(ξk,ηk)E[fk(ξk,ηk)Fan,k1]}0a.s. ωA(α). 2.19

From Eqs. (2.18) and (2.19), we obtain

limn1bnk=an+1an+bn{fk(ξk,ηk)E[fk(ξk,ηk)Fan,k1]}=0a.s. ωA(α).

Thus we complete the proof of Lemma 1. □

Lemma 2

Assume that ζ=(ξ,η)={(ξk,ηk)}k=0 is an HTIMC defined as in Lemma 1. Then, for every j<k; k1,

E[fk(ξk,ηk)Fj,k1]=E[fk(ξk,ηk)ηk1]a.s. 2.20

Proof

From definition of Hidden Markov chain, we have, for every xiX, yjY, mn; n1,

graphic file with name 13660_2018_1884_Equi_HTML.gif

Hence, we have

graphic file with name 13660_2018_1884_Equj_HTML.gif

 □

According to Theorem 1 of Wang [5], it is easy to verify the following lemma.

Lemma 3

Suppose that η=(η0,η1,) is a time inhomogeneous Markov chain which takes value in state space Y, its starting distribution is

(q(ω0),q(ω1);;q(ωb)),q(ωi)>0,ωiY, 2.21

and transition matrices are

Qk=(qk(ωjωi)),qk(ωjωi)>0,ωi,ωjY,k1, 2.22

where

qk(ωjωi)=P(ηk=ωjηk1=ωi),k1.

Assume that Π=(q(ωi,ωj)), q(ωi,ωj)>0, ωi,ωjY is another transition matrix which satisfies the following condition:

limn1bnk=an+1an+bn|qk(ωi,ωj)q(ωi,ωj)|=0ωi,ωjY. 2.23

Then, for each ωsY,

limn1bnk=an+1an+bn1{ωs}(ηk1)=πsa.s., 2.24

where (π0,π1,π2,,πb) is the stationary distribution determined by Π.

Main results

Theorem 1

Let ζ=(ξ,η)={(ξk,ηk)}k=0 be an HTIMC which takes values in X×Y, f(x,y) be a function on X×Y.

Let Π=(q(ωi,ωj)), q(ωi,ωj)>0, ωi,ωjY be another transition matrix and p(θiωj),(θi,ωj)X×Y be conditional probabilities which satisfy

limn1bnk=an+1an+bn|qk(ωi,ωj)q(ωi,ωj)|=0ωi,ωjY, 3.1
limn1bnk=an+1an+bn|pk(θiωj)p(θiωj)|=0(θi,ωj)X×Y. 3.2

If the transition matrix Π has a stationary distribution π=(π0,π1,π2,,πb), then

limn1bnk=an+1an+bnf(ξk,ηk)=θiXωjYωsYπsf(θi,ωj)q(ωs,ωj)p(θiωs)a.s. 3.3

Proof

Since f(x,y) is bounded, we have by Lemmas 1 and 2 that

limn1bnk=an+1an+bn{f(ξk,ηk)E[f(ξk,ηk)ηk1]}=0a.s. 3.4

Observe that

E[f(ξk,ηk)ηk1]=θiXωjYf(θi,ωj)qk(ηk1,ωj)pk(θiηk1).

We have that, by Eq. (3.4),

limsupn|1bnk=an+1an+bnf(ξk,ηk)θiXωjYωsYπsf(θi,ωj)q(ωs,ωj)p(θiωs)|limsupn|1bnk=an+1an+bnE[f(ξk,ηk)ηk1]θiXωjYωsYπsf(θi,ωj)q(ωs,ωj)p(θiωs)|=limsupn|1bnk=an+1an+bnθiXωjYf(θi,ωj)qk(ηk1,ωj)pk(θiηk1)θiXωjYωsYπsf(θi,ωj)q(ωs,ωj)p(θiωs)|=limsupn|1bnk=an+1an+bnθiXωjYωsY1{ωs}(ηk1)πsf(θi,ωj)qk(ωs,ωj)pk(θiωs)θiXωjYωsYπsf(θi,ωj)q(ωs,ωj)p(θiωs)|=limsupn|1bnk=an+1an+bnθiXωjYωsY1{ωs}(ηk1)f(θi,ωj)×[(qk(ωs,ωj)q(ωs,ωj))pk(θiωs)+q(ωs,ωj)(pk(θiωs)p(θiωs))+p(θiωs)q(ωs,ωj)]θiXωjYωsYπsf(θi,ωj)q(ωs,ωj)p(θiωs)|limsupnθiXωjYωsYsupθiX,ωjY|f(θi,ωj)|{|1bnk=an+1an+bn|qk(ωs,ωj)q(ωs,ωj)|+1bnk=anan+bn|pk(θiωs)p(θiωs)||}=0.

Therefore Eq. (3.3) holds. □

Corollary 1

Under the conditions of Theorem 1, we have for each θiX, ωj,ωsY,

limn1bnSan,bn(θi,ωj)=ωsYπsq(ωs,ωj)p(θiωs)a.s. 3.5

Proof

Put f(x,y)=1{θi}(x)1{ωj}(y), (θi,ωj)X×Y in Theorem 1. Then

limn1bnk=an+1an+bnf(ξk,ηk)θiXωjYωsYπsf(θi,ωj)q(ωs,ωj)p(θiωs)=limn1bnk=an+1an+bn1{θi}(ξk)1{ωj}(ηk)θiXωjYωsY1{θi}(θi)1{ωj}(ωj)πsq(ωs,ωj)p(θiωs)=limn1bnSan,bn(θi,ωj)ωsYπsq(ωs,ωj)p(θiωs)=0a.s.

 □

Corollary 2

Under the assumptions of Theorem 1, we have, for each θiX, ωsY,

limn1bnTan,bn(θi)=ωsYπsp(θiωs)a.s. 3.6

Proof

Put f(x,y)=1{θi}(x), (x,y)X×Y in Theorem 1. Then

limn1bnk=an+1an+bnf(ξk,ηk)θiXωjYωsYπsf(θi,ωj)q(ωs,ωj)p(θiωs)=limn1bnk=an+1an+bn1{θi}(ξk)θiXωjYωsY1{θi}(θi)πsq(ωs,ωj)p(θiωs)=limn1bnTan,bn(θi)ωsYπsp(θiωs)=0a.s.

 □

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]

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES