Exponential inequalities for empirical unbounded context trees

zbMath1151.62343arXiv0710.5900MaRDI QIDQ3537732

Antonio Galves, Florencia Leonardi

Publication date: 10 November 2008

Full work available at URL: https://arxiv.org/abs/0710.5900

zbMATH Keywords

algorithm contextvariable memory processes

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Non-Markovian processes: estimation (62M09) Stochastic processes (60G99)

Related Items (10)

Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes ⋮ Nonparametric statistical inference for the context tree of a stationary ergodic process ⋮ Stochastically perturbed chains of variable memory ⋮ Context tree selection and linguistic rhythm retrieval from written texts ⋮ Estimating the interaction graph of stochastic neural dynamics ⋮ Random Markov processes for countable and uncountable alphabets ⋮ Neighborhood radius estimation for variable-neighborhood random fields ⋮ Some upper bounds for the rate of convergence of penalized likelihood context tree estimators ⋮ Context tree selection: a unifying view ⋮ Variable length memory chains: characterization of stationary probability measures

This page was built for publication: Exponential inequalities for empirical unbounded context trees