Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes
From MaRDI portal
Publication:358133
DOI10.3150/12-BEJ468zbMath1412.62113arXiv1307.6338MaRDI QIDQ358133
Publication date: 16 August 2013
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.6338
rate of convergence; minimum description length; oracle inequalities; information criteria; penalized maximum likelihood; finite memory estimator; infinite memory; Markov approximation
60G10: Stationary stochastic processes
62M05: Markov processes: estimation; hidden Markov models
60F15: Strong limit theorems
62B10: Statistical aspects of information-theoretic topics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal codes as a basis for time series testing
- On the minimal penalty for Markov order estimation
- Markov approximation and consistent estimation of unbounded probabilistic suffix trees
- How sampling reveals a process
- Some upper bounds for the rate of convergence of penalized likelihood context tree estimators
- Twice-universal coding
- Chains with infinite connections: Uniqueness and Markov representation
- Prediction of random sequences and universal coding
- Estimating the dimension of a model
- Risk bounds for model selection via penalization
- Measure concentration for a class of random processes
- Markov approximations of chains of infinite order
- Speed of \(\overline d\)-convergence for Markov approximations of chains with complete connections. A coupling approach
- New dependence coefficients. Examples and applications to statistics
- An application of ergodic theory to probability theory
- The consistency of the BIC Markov order estimator.
- Processes with long memory: Regenerative construction and perfect simulation
- A new covariance inequality and applications.
- Exponential inequalities for empirical unbounded context trees
- Context tree estimation for not necessarily finite memory processes, via BIC and MDL
- The performance of universal encoding
- Ideal spatial adaptation by wavelet shrinkage
- Fluctuations of the Empirical Entropies of a Chain of Infinite Order
- Large-scale typicality of Markov sample paths and consistency of MDL order estimators
- The minimum description length principle in coding and modeling
- The optimal error exponent for Markov order estimation
- On Analytic Properties of Entropy Rate
- On Rate of Convergence of Statistical Estimation of Stationary Ergodic Processes
- Bandwidth Selection in Nonparametric Kernel Testing
- Elements of Information Theory
- Information Theory
- Gaussian model selection