Abstract
The strong limit theorem is one of the central questions for studying in the international Probability theory. The purpose of this paper is to give a strong limit theorem for functions of two-ordered Markov chains indexed by a kind of nonhomogeneous tree.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Benjiamini I, Peres Y (1994) Markov Chains indexed by trees. Ann Probab 22:219–243
Zach D, Sunder S (2005) Large deviations for a class of nonhomogneous Markov chains. Ann Probab 15:421–486
Yang WG, Ye Z, Liu W (2006) A local convergence theorem for partial sums of stochastic adapted sequence. Czechoslovak Math J 56:525–532
Yang W (2003) Some limit properties for Markov chains indexed by a homogeneous tree. Stat Probab Lett 65:241–250
Fan Z, Jin S, Bian J (2009) The recurrence for the tree indexed Markov chains. Math Pract Theory 39:221–223
Shi J (1999) The discrete martingale and its application, vol 35. The Science Press, Beijing, pp 743–745
Yang WG (2009) Strong law of large numbers for countable nonhomogeneous Markov Chains. Linear Algebra Appl 430:3008–3018
Fan ZY, Zhai QL, Jin S (2010) Some limit properties for nonhomogeneous tree indexed Markov Chains. Proc CDEE 2010 2010:91–94
Fan ZY, Jin S, Bian J (2009) A new application of stochastic matrices. The proceeding of 3th international workshop on matrix analysis, vol 1. World Academic Press, New York, pp 121–125
Isaac k (1999) On equitable ratios of dubins-freedman type. Stat Probab Lett 42:1–6
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this paper
Cite this paper
Fan, Z., Zhang, J., Bian, J., Wang, Y. (2013). Some New Results for the Tree Indexed Markov Chains. In: Zhong, Z. (eds) Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012. Lecture Notes in Electrical Engineering, vol 219. Springer, London. https://doi.org/10.1007/978-1-4471-4853-1_72
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4853-1_72
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4852-4
Online ISBN: 978-1-4471-4853-1
eBook Packages: EngineeringEngineering (R0)