Compressing redundant information in Markov chains
classification
🧮 math.PR
keywords
markovchaininformationredundantalgorithmchainsclassicalcomplexity
read the original abstract
Given a strongly stationary Markov chain and a finite set of stopping rules, we prove the existence of a polynomial algorithm which projects the Markov chain onto a minimal Markov chain without redundant information. Markov complexity is hence defined and tested on some classical problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.