Variable length Markov chains

DOI10.1214/AOS/1018031204zbMath0983.62048OpenAlexW2011485152WikidataQ98839750 ScholiaQ98839750MaRDI QIDQ1970475

Publication date: 25 April 2002

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1018031204

zbMATH Keywords

bootstrap consistency model selection data compression central limit theorem Kullback-Leibler distance categorical time series context algorithm FSMX model tree model finite-memory sources

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Markov processes: estimation; hidden Markov models (62M05) Nonparametric statistical resampling methods (62G09) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10)

Related Items (62)

Bootstraps for time series ⋮ The mixture transition distribution model for high-order Markov chains and non-Gaussian time series ⋮ Necessary and sufficient conditions for the moving blocks bootstrap central limit theorem of the mean ⋮ Estimating the interaction graph of stochastic neuronal dynamics by observing only pairs of neurons ⋮ Context Trees, Variable Length Markov Chains and Dynamical Sources ⋮ A Note on Distinguishing Random Trees Populations ⋮ Variable length Markov chain with exogenous covariates ⋮ Recurrent Neural Networks with Small Weights Implement Definite Memory Machines ⋮ Bayesian clustering of DNA sequences using Markov chains and a stochastic partition model ⋮ Sparse Markov Chains for Sequence Data ⋮ Some notes on the classification of shift spaces: shifts of finite type; sofic shifts; and finitely defined shifts ⋮ Modelling discrete longitudinal data using acyclic probabilistic finite automata ⋮ Estimation and Selection for High-Order Markov Chains with Bayesian Mixture Transition Distribution Models ⋮ A framework for space-efficient string kernels ⋮ A dynamic ``predict, then optimize preventive maintenance approach using operational intervention data ⋮ Nonparametric statistical inference for the context tree of a stationary ergodic process ⋮ Stochastically perturbed chains of variable memory ⋮ Another look at the disjoint blocks bootstrap ⋮ Detecting renewal states in chains of variable length via intrinsic Bayes factors ⋮ Algorithms for learning parsimonious context trees ⋮ Stratified graphical models -- context-specific independence in graphical models ⋮ Fitting sparse Markov models through a collapsed Gibbs sampler ⋮ Context tree selection and linguistic rhythm retrieval from written texts ⋮ Hidden Markov partition models ⋮ Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions ⋮ Time-varying Markov models for binary temperature series in agrorisk management ⋮ Spatio-temporal spike train analysis for large scale networks using the maximum entropy principle and Monte Carlo method ⋮ Random Markov processes for countable and uncountable alphabets ⋮ Statistical Learning With Time Series Dependence: An Application to Scoring Sleep in Mice ⋮ A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping ⋮ Weakly dependent chains with infinite memory ⋮ Recursive learning for sparse Markov models ⋮ Relevant states and memory in Markov chain bootstrapping and simulation ⋮ Rule generation for categorical time series with Markov assumptions ⋮ Generalized choice models for categorical time series ⋮ Joint Estimation of Intersecting Context Tree Models ⋮ Regression theory for categorical time series ⋮ Remembrance of Leo Breiman ⋮ Bayesian analysis of variable-order, reversible Markov chains ⋮ A block bootstrap comparison for sparse chains ⋮ Consistent estimation of the basic neighborhood of Markov random fields ⋮ Testing statistical hypothesis on random trees and applications to the protein classification problem ⋮ Exponential inequalities for VLMC empirical trees ⋮ Some upper bounds for the rate of convergence of penalized likelihood context tree estimators ⋮ Context tree selection: a unifying view ⋮ Multifractal properties of Hao's geometric representations of DNA sequences ⋮ Unnamed Item ⋮ On universal algorithms for classifying and predicting stationary processes ⋮ Approximating multivariate Markov chains for bootstrapping through contiguous partitions ⋮ mixvlmc ⋮ Context-Specific and Local Independence in Markovian Dependence Structures ⋮ Экономные модели цепей Маркова высокого порядка для оценивания криптографических генераторов ⋮ Measuring the efficiency of the intraday Forex market with a universal data compression algorithm ⋮ Statistical analysis of multivariate discrete-valued time series ⋮ Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm ⋮ Approximating Markov Chains for Bootstrapping and Simulation ⋮ A hidden Markov model with dependence jumps for predictive modeling of multidimensional time-series ⋮ Distributions of pattern statistics in sparse Markov models ⋮ Efficient and adaptive post-model-selection estimators ⋮ The consistency of the BIC Markov order estimator. ⋮ Investigating purchasing-sequence patterns for financial services using Markov, MTD and MTDG models ⋮ Robust Model Selection for Stochastic Processes

Uses Software

Fahrmeir

Cites Work

This page was built for publication: Variable length Markov chains