A Strong Law of Large Numbers for Markov Chain Fields on a Special Non-homogeneous Tree

Author(s):  
Jin Shaohua ◽  
Zhong Yanyan ◽  
Wan Yanping ◽  
Chen Xiuyin
Filomat ◽  
2019 ◽  
Vol 33 (6) ◽  
pp. 1817-1832
Author(s):  
Huilin Huang ◽  
Weiguo Yang

In this paper, we give the definition of an asymptotic circularmth-order Markov chain indexed by an m rooted homogeneous tree. By applying the limit property for a sequence of multi-variables functions of a nonhomogeneous Markov chain indexed by such tree, we estabish the strong law of large numbers and the asymptotic equipartition property (AEP) for asymptotic circular mth-order finite Markov chains indexed by this homogeneous tree. As a corollary, we can obtain the strong law of large numbers and AEP about the mth-order finite nonhomogeneous Markov chain indexed by the m rooted homogeneous tree.


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.


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.


1974 ◽  
Vol 11 (3) ◽  
pp. 582-587 ◽  
Author(s):  
G. L. O'Brien

Chain-dependent processes, also called sequences of random variables defined on a Markov chain, are shown to satisfy the strong law of large numbers. A central limit theorem and a law of the iterated logarithm are given for the case when the underlying Markov chain satisfies Doeblin's hypothesis. The proofs are obtained by showing independence of the initial distribution of the chain and by then restricting attention to the stationary case.


1974 ◽  
Vol 11 (03) ◽  
pp. 582-587 ◽  
Author(s):  
G. L. O'Brien

Chain-dependent processes, also called sequences of random variables defined on a Markov chain, are shown to satisfy the strong law of large numbers. A central limit theorem and a law of the iterated logarithm are given for the case when the underlying Markov chain satisfies Doeblin's hypothesis. The proofs are obtained by showing independence of the initial distribution of the chain and by then restricting attention to the stationary case.


1975 ◽  
Vol 7 (01) ◽  
pp. 195-214 ◽  
Author(s):  
Gary Lee Guthrie ◽  
Paul T. Holmes

The familiar three theorems of Rényi concerning the record times in an i.i.d. sequence of random variables are extended to the record times and inter-record times of a sequence of dependent, non-identically distributed random variables defined on a finite Markov chain. These theorems are the Central Limit Theorem (C.L.T.), the Strong Law of Large Numbers (S.L.L.N.) and the Law of the Iterated Logarithm (L.I.L.). Similar results are also obtained for m-record times, inter-m-record times, and for the continuous parameter situation when observations are taken at the epochs of a Poisson process.


1975 ◽  
Vol 7 (1) ◽  
pp. 195-214 ◽  
Author(s):  
Gary Lee Guthrie ◽  
Paul T. Holmes

The familiar three theorems of Rényi concerning the record times in an i.i.d. sequence of random variables are extended to the record times and inter-record times of a sequence of dependent, non-identically distributed random variables defined on a finite Markov chain. These theorems are the Central Limit Theorem (C.L.T.), the Strong Law of Large Numbers (S.L.L.N.) and the Law of the Iterated Logarithm (L.I.L.). Similar results are also obtained for m-record times, inter-m-record times, and for the continuous parameter situation when observations are taken at the epochs of a Poisson process.


Sign in / Sign up

Export Citation Format

Share Document