Abstract
ABSTRACTConsider a Markov chain with finite alphabets. In this paper, we study the asymptotic properties of moving average, harmonic mean, and strong deviation theorems (limit theorems expressed by inequalities) of moving geometric average of random transition probabilities and the generalized entropy ergodic theorem for Markov chains in single infinite Markovian environments. It is shown that, under some mild conditions, the sequence of the generalized relative entropy density converges almost surely and in . The trick of the proofs is the construction of random variables with a parameter and the application of Borel–Cantelli lemma.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
