arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0605099math.PR

Compressing redundant information in Markov chains

Giacomo Aletti

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑