Advanced search
Publication Cover
Communications in Statistics - Theory and Methods Volume 49, 2020 - Issue 9
Submit an article Journal homepage
52
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Strong law of large numbers of the delayed sums for Markov Chains indexed by a Cayley tree

Pingping ZhongFaculty of Science, Jiangsu University, Zhenjiang, China; ;Jingjiang College of Jiangsu University, Jiangsu University, Zhenjiang, ChinaCorrespondence[email protected]
View further author information
,
Weiguo YangFaculty of Science, Jiangsu University, Zhenjiang, China; View further author information
&
Jie YangFaculty of Science, Jiangsu University, Zhenjiang, China; View further author information
Pages 2285-2294 | Received 14 Sep 2018, Accepted 14 Jan 2019, Published online: 10 Feb 2019

References

  • Benjamini, I., and Y. Peres. 1994. Markov chains indexed by trees. The Annals of Probability 22 (1):219–43. doi: 10.1214/aop/1176988857.
  • Berger, T., and Z. Ye. 1990. Entropic aspects of random fields on trees. IEEE Transactions on Information Theory 36 (5):1006–18. doi: 10.1109/18.57200.
  • Dang, H., W. G. Yang, and Z. Y. Shi. 2015. The strong law of large numbers and the entropy ergodic theorem for nonhomogeneous bifurcating Markov chains indexed by a binary tree. IEEE Transactions on Information Theory 61 (4):1640–8. doi: 10.1109/TIT.2015.2404310.
  • Delmas, J. F., and L. Marsalle. 2010. Detection of cellular aging in a Galton-Watson process. Stochastic Processes and their Applications 120 (12):2495–519. doi: 10.1016/j.spa.2010.07.002.
  • Dembo, A., P. Mörters, and S. Sheffield. 2005. Large deviations of Markov chains indexed by random trees. Annales de l'Institut Henri Poincare (B) Probability and Statistics 41 (6):971–96. doi: 10.1016/j.anihpb.2004.09.005.
  • Dong, Y., W. G. Yang, and J. F. Bai. 2011. The strong law of large numbers and the Shannon-McMillan theorem for nonhomogeneous Markov chains indexed by a Cayley tree. Statistics & Probability Letters 81 (12):1883–90. doi: 10.1016/j.spl.2011.06.021.
  • Huang, H. L., and W. G. Yang. 2008. Strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree. Science in China Series A: Mathematics 51 (2):195–202. doi: 10.1007/s11425-008-0015-1.
  • Isaacson, D., and R. Madsen. 1976. Markov chains theory and applications. New York: Wiley.
  • Pemantle, P. 1992. Automorphism invariant measures on trees. The Annals of Probability 20 (3):1549–66. doi: 10.1214/aop/1176989706.
  • Terpstra, J. T., and T. Elbayoumi. 2012. A law of large numbers result for a bifurcating process with an infinite moving average representation. Statistics & Probability Letters 82 (1):123–9. doi: 10.1016/j.spl.2011.09.012.
  • Wang, B., W. G. Yang, and Z. Y. Shi. 2012. Strong law of large numbers for countable Markov chains indexed by a Cayley tree. Scientia Sinica Mathematica 42:1031–6. doi: 10.1360/012012-47.
  • Yang, W. G. 2003. Some limit properties for Markov chains indexed by a homogeneous tree. Statistics & Probability Letters 65 (3):241–50. doi: 10.1016/j.spl.2003.04.001.
  • Yang, W. G., and Z. Ye. 2007. The asymptotic equipartition property for nonhomogeneous Markov chains indexed by a homogeneous tree. IEEE Transactions on Information Theory 53 (9):3275–80. doi: 10.1109/TIT.2007.903134.
  • Ye, Z., and T. Berger. 1996. Ergodicity, regularity and asymptotic equipartition property of random fields on trees. Journal of Combinatorics, Information & System Sciences : A Quarterly International Scientific Journal 21:157–84.
  • Ye, Z., and T. Berger. 1998. Information measures for discrete random fields. Beijing: Science Press.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.