Strong laws of large numbers for the mth-order asymptotic odd–even Markov chains indexed by an m-rooted Cayley tree

DOI10.1080/03610926.2015.1030422zbMath1360.60070OpenAlexW2320715885MaRDI QIDQ2979965

Zhiyan Shi, Wei-guo Yang

Publication date: 27 April 2017

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610926.2015.1030422

zbMATH Keywords

strong law of large numbersasymptotic equipartition property\(m\)-Rooted Cayley tree\(m\)th-Order asymptotic odd-even Markov chain

Mathematics Subject Classification ID

Strong limit theorems (60F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• A Mathematical Theory of Communication
• Strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree
• Some limit properties for the \(m\)th-order nonhomogeneous Markov chains indexed by an m rooted Cayley tree
• The strong ergodic theorem for densities: Generalized Shannon-McMillan- Breiman theorem
• A sandwich proof of the Shannon-McMillan-Breiman theorem
• Automorphism invariant measures on trees
• Markov chains indexed by trees
• Some limit properties for Markov chains indexed by a homogeneous tree.
• Strong law of large numbers for Markov chains field on a Bethe tree
• An extension of Shannon-McMillan theorem and some limit properties for nonhomogeneous Markov chains
• The Individual Ergodic Theorem of Information Theory
• The Asymptotic Equipartition Property for<tex>$M$</tex>th-Order Nonhomogeneous Markov Information Sources
• The Asymptotic Equipartition Property for Nonhomogeneous Markov Chains Indexed by a Homogeneous Tree
• Entropic aspects of random fields on trees
• A Note on the Ergodic Theorem of Information Theory
• The Basic Theorems of Information Theory

This page was built for publication: Strong laws of large numbers for the mth-order asymptotic odd–even Markov chains indexed by an m-rooted Cayley tree