Exponential inequalities for empirical unbounded context trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper we obtain non-uniform 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 several previous results in the field.
13 pages

Keywords

Statistics Theory, Probability, 62M09; 60G99

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/161366

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0710.5900
 http://arxiv.org/abs/0710.5900

Collections

arXiv