Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 325361, 5 pages
http://dx.doi.org/10.1155/2014/325361
Research Article

Strong Law of Large Numbers for Countable Markov Chains Indexed by an Infinite Tree with Uniformly Bounded Degree

1Faculty of Science, Jiangsu University, Zhenjiang 212013, China
2College of Mathematics and Physics, Xuzhou Institute of Technology, Xuzhou 221000, China
3School of Mathematical Science, Huaiyin Normal University, Huaian 223300, China

Received 2 October 2013; Revised 15 January 2014; Accepted 3 February 2014; Published 13 March 2014

Academic Editor: Martin Ostoja-Starzewski

Copyright © 2014 Bao Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. I. Benjamini and Y. Peres, “Markov chains indexed by trees,” The Annals of Probability, vol. 22, no. 1, pp. 219–243, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. D. Isaacson and R. Madsen, Markov Chains Theory and Application, John Wiley & Sons, New York, NY, USA, 1976.
  3. C. E. Shannon, “A mathematical theory of communication,” The Bell System Technical Journal, vol. 27, no. 3, pp. 379–423, 1948. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. B. McMillan, “The basic theorems of information theory,” The Annals of Mathematical Statistics, vol. 24, no. 2, pp. 196–219, 1953. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. L. Breiman, “The individual ergodic theorem of information theory,” The Annals of Mathematical Statistics, vol. 28, no. 3, pp. 809–811, 1957. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. L. Breiman, “Correction to the individual ergodic theorem of information theory,” The Annals of Mathematical Statistics, vol. 31, no. 3, pp. 809–810, 1960. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. K. L. Chung, “A note on the ergodic theorem of information theory,” The Annals of Mathematical Statistics, vol. 32, no. 2, pp. 612–614, 1961. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. J. Guyon, “Limit theorems for bifurcating Markov chains application to the detection of cellular aging,” The Annals of Applied Probability, vol. 17, no. 5-6, pp. 1538–1569, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. T. Berger and Z. Ye, “Entropic aspects of random fields on trees,” IEEE Transactions on Information Theory, vol. 36, no. 5, pp. 1006–1018, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. Z. Ye and T. Berger, “Ergodic, regulary and asymptotic equipartition property of random fields on trees,” Journal of Combinatorics, Information & System Sciences, vol. 21, no. 2, pp. 157–184, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. Z. Ye and T. Berger, Information Measures for Discrete Random Field, Science Press, Beijing, China, 1998. View at MathSciNet
  12. R. Pemantle, “Antomorphism invariant measure on trees,” The Annals of Probability, vol. 20, no. 3, pp. 1549–1566, 1992. View at Publisher · View at Google Scholar
  13. W. Yang, “Some limit properties for Markov chains indexed by a homogeneous tree,” Statistics & Probability Letters, vol. 65, no. 3, pp. 241–250, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. W. Yang and Z. Ye, “The asymptotic equipartition property for nonhomogeneous Markov chains indexed by a homogeneous tree,” IEEE Transactions on Information Theory, vol. 53, no. 9, pp. 3275–3280, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. H. Huang and W. Yang, “Strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree,” Science in China A, vol. 51, no. 2, pp. 195–202, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  16. B. Wang, W. G. Yang, and Z. Y. Shi, “Strong laws of large numbers for countable Markov hains indexed by a Cayley tree,” Scientia Sinica A, vol. 42, pp. 1031–1036, 2012 (Chinese). View at Publisher · View at Google Scholar