Some upper bounds for the rate of convergence of penalized likelihood context tree estimators
type: Item
instance of: scholarly article
title: Some upper bounds for the rate of convergence of penalized likelihood context tree estimators
zbMATH Open document ID: 1192.62193
DOI: 10.1214/09-BJPS033
author: Florencia Leonardi
published in: Brazilian Journal of Probability and Statistics
publication date: 2010-08-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/math/0701810
Mathematics Subject Classification ID: 62M09
Mathematics Subject Classification ID: 62M99
Mathematics Subject Classification ID: 62F12
zbMATH DE Number: 5764985
zbMATH Keywords: context tree
zbMATH Keywords: penalized maximum likelihood estimation
zbMATH Keywords: Bayesian information criterion
zbMATH Keywords: rate of convergence
MaRDI profile type: MaRDI publication profile
arXiv ID: math/0701810
cites work: Variable length Markov chains
cites work: Processes with long memory: Regenerative construction and perfect simulation
cites work: Context tree estimation for not necessarily finite memory processes, via BIC and MDL
cites work: Exponential bounds for the probability of wrong determination of the order of a Markov chain by using the EDC criterion
cites work: Markov approximation and consistent estimation of unbounded probabilistic suffix trees
cites work: Estimation of General Stationary Processes by Variable Length Markov Chains
cites work: The optimal error exponent for Markov order estimation
cites work: Exponential inequalities for empirical unbounded context trees
cites work: Exponential inequalities for VLMC empirical trees
cites work: Consistency of the Unlimited BIC Context Tree Estimator
cites work: A universal data compression system
cites work: The context-tree weighting method: extensions
cites work: The context-tree weighting method: basic properties
description: scientific article