Estimating the Lengths of Memory Words

DOI10.1109/TIT.2008.926316MaRDI QIDQ3604769zbMATHWikidataFDO

Authors Gusztáv Morvai, Benjamin Weiss

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stationary stochastic processes (60G10)

Recommendations

• On estimating the memory for finitarily Markovian processes
• Memory-universal prediction of stationary random processes
• Some Stochastic Properties of Memoryless Individual Sequences
• Estimation of General Stationary Processes by Variable Length Markov Chains
• Context tree estimation for not necessarily finite memory processes, via BIC and MDL

Cited in

(5)

• On universal algorithms for classifying and predicting stationary processes
• On estimating the memory for finitarily Markovian processes
• Consistency, integrability and asymptotic normality for some intermittent estimators
• Testing stationary processes for independence
• Countable alphabet stationary processes with at least one memory word and intermittent estimation with universal rates

This page was built for publication: Estimating the Lengths of Memory Words

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