Markov approximation and consistent estimation of unbounded probabilistic suffix trees

DOI10.1007/S00574-006-0029-7MaRDI QIDQ870475zbMATH OpenOpenAlexWikidataFDO

Authors Denise Duarte, A. Galves, N. L. Garcia

Publication date 12 March 2007

Published in Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00574-006-0029-7

zbMATH Keywords

algorithm contextvariable length Markov chains

Mathematics Subject Classification ID

Strong limit theorems (60F15) Special processes (60K99)

Recommendations

• Exponential inequalities for VLMC empirical trees
• Estimation of General Stationary Processes by Variable Length Markov Chains
• Exponential inequalities for empirical unbounded context trees
• Consistency of the Unlimited BIC Context Tree Estimator
• Variable length Markov chains

Cited in

(9)

• Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
• Exponential inequalities for VLMC empirical trees
• Context tree selection: a unifying view
• Exponential inequalities for empirical unbounded context trees
• Stochastically perturbed chains of variable memory
• Random perturbations of stochastic processes with unbounded variable length memory
• Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes
• scientific article; zbMATH DE number 1931834 (Why is no real title available?)
• Some upper bounds for the rate of convergence of penalized likelihood context tree estimators

This page was built for publication: Markov approximation and consistent estimation of unbounded probabilistic suffix trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870475)