The Asymptotic Equipartition Property for Nonhomogeneous Markov Chains Indexed by Trees

  • Peng Weicai
  • Chen Peishu
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 181)

Abstract

In this paper, the tree T is a general tree. We prove the strong law of large numbers and the asymptotic equipartition property (AEP) for finite nonhomogeneous Markov chains indexed by trees. The results generalize some known results.

Keywords

Nonhomogeneous Markov chain Tree Strong law of large numbers 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Benjamini, I., Peres, Y.: Markov chains indexed by trees. Ann. Probab. 22, 219–243 (1994)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Berger, T., Ye, Z.-X.: Entropic aspects of random fields on trees. IEEE Trans. Inform. Theory 36(5), 1006–1018 (1990)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Yang, W.-G., Ye, Z.-X.: The Asympotoic equipartition property for nonhomogeneous Markov chains indexed by a Homogeneous tree. IEEE Trans. Inform. Theory 53(9), 3275–3280 (2007)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Huang, H.-L., Yang, W.-G.: Strong law of large numbers for Markov chains indexed by an infinitetree with uniformly bounded degeree. Science in China Series A: Mathematics 51(2), 195–202 (2008)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Peng Weicai
    • 1
  • Chen Peishu
    • 1
  1. 1.Department of MathematicsChaohu UniversityChaohuP.R. China

Personalised recommendations