The strong law of large numbers and the Shannon-McMillan theorem for the mth-order nonhomogeneous Markov chains indexed by an m rooted Cayley tree
From MaRDI portal
Publication:2811414
DOI10.1080/03610926.2013.791371zbMath1339.60024OpenAlexW2049775673MaRDI QIDQ2811414
Publication date: 10 June 2016
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610926.2013.791371
Strong limit theorems (60F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- A Mathematical Theory of Communication
- Some limit theorems for the second-order Markov chains indexed by a general infinite tree with uniform bounded degree
- The strong law of large numbers and the Shannon-McMillan theorem for nonhomogeneous Markov chains indexed by a Cayley tree
- 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
