Strong law of large numbers and Shannon-McMillan theorem for Markov chain fields on trees

IEEE Transactions on Information Theory

Volumn 48, Issue 1, 2002, Pages 313-318

  Yang, Weiguo ^a   Liu, Wen ^b  

^a JIANGSU UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HEBEI UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Bethe tree; Markov chain fields; Random fields; Rooted Cayley tree; Shannon McMillan theorem; Strong law of large numbers

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MARKOV PROCESSES; NUMBER THEORY; PROBABILITY; SET THEORY; THEOREM PROVING;

BETHE TREE; ROOTED CAYLEY TREE; SHANNON-MCMILLAN THEOREM;

TREES (MATHEMATICS);

EID: 0036163264     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.971762     Document Type: Letter

References (7)

1. Entropic aspects of random fields on trees
2. Relative entropy densities and a class of limit theorems of the sequence of m-valued random variables
3. An extension of Shannon-McMillan theorem and some limit properties for nonhomogeneous Markov chains
4. Antomorphism invariant measure on trees
5. Markov random fields on an infinite tree
6. Ergodic, regularty and asymptotic equipartition property of random fields on trees
7. Information measures for discrete random fields