Exponential inequalities for empirical unbounded context trees
| dc.creator | Galves, Antonio | |
| dc.creator | Leonardi, Florencia | |
| dc.date | 2007-10-31 | |
| dc.date | 2008-05-22 | |
| dc.date.accessioned | 2026-07-07T09:40:03Z | |
| dc.date.available | 2026-07-07T09:40:03Z | |
| dc.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. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/0710.5900 | |
| dc.identifier | http://arxiv.org/abs/0710.5900 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161366 | |
| dc.subject | Statistics Theory | |
| dc.subject | Probability | |
| dc.subject | 62M09; 60G99 | |
| dc.title | Exponential inequalities for empirical unbounded context trees | |
| dc.type | text |