Estimating the Lengths of Memory Words

DOI10.1109/TIT.2008.926316zbMATH Open1329.60095WikidataQ105584784 ScholiaQ105584784MaRDI QIDQ3604769FDOQ3604769

Authors: Gusztáv Morvai, Benjamin Weiss 

Publication date: 24 February 2009

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

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

Mathematics Subject Classification ID

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

Cited In (5)

• On estimating the memory for finitarily Markovian processes
• Consistency, integrability and asymptotic normality for some intermittent estimators
• Testing stationary processes for independence
• On universal algorithms for classifying and predicting stationary processes
• 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)