Compressing redundant information in Markov chains

Simple item page
dc.creatorAletti, Giacomo
dc.date2006-05-03
dc.date2006-06-23
dc.date.accessioned2026-07-07T07:13:53Z
dc.date.available2026-07-07T07:13:53Z
dc.descriptionGiven 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.
dc.description8 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0605099
dc.identifierhttp://arxiv.org/abs/math/0605099
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112646
dc.subjectProbability
dc.subject60J22; 90C35, 94C15
dc.titleCompressing redundant information in Markov chains
dc.typetext

Files

Collections

arXiv