Exponential inequalities for empirical unbounded context trees
From MaRDI portal
Abstract: 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.
Recommendations
- Exponential inequalities for VLMC empirical trees
- Some upper bounds for the rate of convergence of penalized likelihood context tree estimators
- Context tree selection: a unifying view
- Markov approximation and consistent estimation of unbounded probabilistic suffix trees
- Consistency of the Unlimited BIC Context Tree Estimator
Cited in
(12)- Estimating the interaction graph of stochastic neural dynamics
- Variable length memory chains: characterization of stationary probability measures
- Context tree selection and linguistic rhythm retrieval from written texts
- Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes
- Random Markov processes for countable and uncountable alphabets
- Exponential inequalities for VLMC empirical trees
- Neighborhood radius estimation for variable-neighborhood random fields
- Context tree selection: a unifying view
- Markov approximation and consistent estimation of unbounded probabilistic suffix trees
- Nonparametric statistical inference for the context tree of a stationary ergodic process
- Stochastically perturbed chains of variable memory
- Some upper bounds for the rate of convergence of penalized likelihood context tree estimators
This page was built for publication: Exponential inequalities for empirical unbounded context trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537732)
