Compressing redundant information in Markov chains

Details Compressing redundant information in Markov chains Compressing redundant information in Markov chains

2006-05-03

arxiv.org/abs/math/0605099v2

Mathematics

Probability

8 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Compressing redundant information in Markov chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compressing redundant information in Markov chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressing redundant information in Markov chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307482