Strong law of large numbers for generalized sample relative entropy of non homogeneous Markov chains

DOI10.1080/03610926.2017.1321770zbMath1444.94033OpenAlexW2612140554MaRDI QIDQ4563470

Jie Yang, Yiqing Li, Yue Zhang, Zhiyan Shi, Bei Wang, Wei-guo Yang

Publication date: 1 June 2018

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

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

zbMATH Keywords

strong law of large numbersnon homogeneous Markov chainsgeneralized sample relative entropy

Mathematics Subject Classification ID

Strong limit theorems (60F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Measures of information, entropy (94A17)

Related Items (1)

THE STRONG LIMIT THEOREM FOR RELATIVE ENTROPY DENSITY RATES BETWEEN TWO ASYMPTOTICALLY CIRCULAR MARKOV CHAINS

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• The generalized entropy ergodic theorem for nonhomogeneous Markov chains
• Some generalized limit theorems concerning delayed sums of random sequences
• On strong law of large numbers for dependent random variables
• On the strong law of large numbers for delayed sums and random fields
• 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
• A class of small deviation theorems for functionals of random fields on a homogeneous tree
• Limit theorems for delayed sums
• A note on the strong law of large numbers for Markov chains indexed by irregular trees
• Retraction: ``Strong limiting behavior in binary search trees
• The Strong Law of Large Numbers and the Entropy Ergodic Theorem for Nonhomogeneous Bifurcating Markov Chains Indexed by a Binary Tree
• 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 ASYMPTOTIC CIRCULAR MARKOV CHAINS
• Some limit theorems of runs to the continuous‐valued sequence
• The Asymptotic Equipartition Property for a Nonhomogeneous Markov Information Source
• STRONG LAW OF LARGE NUMBERS FOR MARKOV CHAINS INDEXED BY SPHERICALLY SYMMETRIC TREES
• The Basic Theorems of Information Theory
• Some strong limit theorems for nonhomogeneous Markov chains indexed by controlled trees

This page was built for publication: Strong law of large numbers for generalized sample relative entropy of non homogeneous Markov chains