نتایج جستجو برای: strong convergence
تعداد نتایج: 479055 فیلتر نتایج به سال:
2008
ANTONIO GALVES
Abstract. In this paper we obtain exponential upper bounds for the rate of convergence of a version of the algorithm Context, when the underlying tree is not necessarily bounded. The algorithm Context is a well-known tool to estimate the context tree of a Variable Length Markov Chain. As a consequence of the exponential bounds we obtain a strong consistency result. We generalize in this way sev...
Journal:
:Journal of Applied Probability
2007
Journal:
:Filomat
2016
Journal:
:Journal of Mathematical Analysis and Applications
2001
Journal:
:Annales de l'Institut Henri Poincaré C, Analyse non linéaire
2008
Journal:
:Annales Henri Poincaré
2018
Journal:
:Glasgow Mathematical Journal
2011
Journal:
:Czechoslovak Mathematical Journal
1987
Journal:
:Mathematics of Computation
1995
Journal:
:Proceedings Mathematical Sciences
2007
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید