On the minimal penalty for Markov order estimation
From MaRDI portal
Publication:718903
DOI10.1007/s00440-010-0290-yzbMath1235.62120arXiv0908.3666MaRDI QIDQ718903
Publication date: 27 September 2011
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0908.3666
Markov chains; martingale inequalities; empirical process theory; large-scale typicality; uniform law of iterated logarithm
60E15: Inequalities; stochastic orderings
60G42: Martingales with discrete parameter
62M05: Markov processes: estimation; hidden Markov models
60F15: Strong limit theorems
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Related Items
Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes, On universal algorithms for classifying and predicting stationary processes
Cites Work
- Unnamed Item
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- The consistency of the BIC Markov order estimator.
- Weak convergence and empirical processes. With applications to statistics
- Context tree estimation for not necessarily finite memory processes, via BIC and MDL
- Strongly consistent code-based identification and order estimation for constrained finite-state model classes
- Large-scale typicality of Markov sample paths and consistency of MDL order estimators