scholarly journals Strong Law of Large Numbers for Hidden Markov Chains Indexed by Cayley Trees

2012 ◽  
Vol 2012 ◽  
pp. 1-11
Author(s):  
Huilin Huang

We extend the idea of hidden Markov chains on lines to the situation of hidden Markov chains indexed by Cayley trees. Then, we study the strong law of large numbers for hidden Markov chains indexed by Cayley trees. As a corollary, we get the strong limit law of the conditional sample entropy rate.

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Huilin Huang

We study strong limit theorems for hidden Markov chains fields indexed by an infinite tree with uniformly bounded degrees. We mainly establish the strong law of large numbers for hidden Markov chains fields indexed by an infinite tree with uniformly bounded degrees and give the strong limit law of the conditional sample entropy rate.


2010 ◽  
Vol 24 (2) ◽  
pp. 279-288 ◽  
Author(s):  
Pingping Zhong ◽  
Weiguo Yang ◽  
Peipei Liang

In this article, we study the asymptotic equipartition property (AEP) for asymptotic circular Markov chains. First, the definition of an asymptotic circular Markov chain is introduced. Then by applying the limit property for the bivariate functions of nonhomogeneous Markov chains, the strong limit theorem on the frequencies of occurrence of states for asymptotic circular Markov chains is established. Next, the strong law of large numbers on the frequencies of occurrence of states for asymptotic circular Markov chains is obtained. Finally, we prove the AEP for asymptotic circular Markov chains.


Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 273-283 ◽  
Author(s):  
Huilin Huang

We firstly define a Markov chain indexed by a homogeneous tree in a finite i.i.d random environment. Then, we prove the strong law of large numbers and Shannon-McMillan theorem for finite Markov chains indexed by a homogeneous tree in the finite i.i.d random environment.


2017 ◽  
Vol 32 (4) ◽  
pp. 626-639 ◽  
Author(s):  
Zhiyan Shi ◽  
Pingping Zhong ◽  
Yan Fan

In this paper, we give the definition of tree-indexed Markov chains in random environment with countable state space, and then study the realization of Markov chain indexed by a tree in random environment. Finally, we prove the strong law of large numbers and Shannon–McMillan theorem for Markov chains indexed by a Cayley tree in a Markovian environment with countable state space.


Author(s):  
Pingping Zhong ◽  
Weiguo Yang ◽  
Zhiyan Shi ◽  
Yan Zhang

AbstractThe purpose of this paper is to establish some limit theorems of delayed averages for countable nonhomogeneous Markov chains. The definition of the generalized C-strong ergodicity and the generalized uniformly C-strong ergodicity for countable nonhomogeneous Markov chains is introduced first. Then a theorem about the generalized C-strong ergodicity and the generalized uniformly C-strong ergodicity for the nonhomogeneous Markov chains is established, and its applications to the information theory are given. Finally, the strong law of large numbers of delayed averages of bivariate functions for countable nonhomogeneous Markov chains is proved.


2012 ◽  
Vol 2012 ◽  
pp. 1-9
Author(s):  
Huilin Huang

We study the limit law of the offspring empirical measure and for Markov chains indexed by homogeneous tree with almost everywhere convergence. Then we prove a Shannon-McMillan theorem with the convergence almost everywhere.


Sign in / Sign up

Export Citation Format

Share Document