Viterbi Sequences and Polytopes
| dc.creator | Kuo, Eric H. | |
| dc.date | 2004-01-24 | |
| dc.date | 2005-01-14 | |
| dc.date.accessioned | 2026-07-07T06:28:47Z | |
| dc.date.available | 2026-07-07T06:28:47Z | |
| dc.description | A Viterbi path of length n of a discrete Markov chain is a sequence of n+1 states that has the greatest probability of ocurring in the Markov chain. We divide the space of all Markov chains into Viterbi regions in which two Markov chains are in the same region if they have the same set of Viterbi paths. The Viterbi paths of regions of positive measure are called Viterbi sequences. Our main results are (1) each Viterbi sequence can be divided into a prefix, periodic interior, and suffix, and (2) as n increases to infinity (and the number of states remains fixed), the number of Viterbi regions remains bounded. The Viterbi regions correspond to the vertices of a Newton polytope of a polynomial whose terms are the probabilities of sequences of length n. We characterize Viterbi sequences and polytopes for two- and three-state Markov chains. | |
| dc.description | 15 pages, 2 figures, to appear in Journal of Symbolic Computation | |
| dc.identifier | https://arxiv.org/abs/math/0401342 | |
| dc.identifier | http://arxiv.org/abs/math/0401342 | |
| dc.identifier | Journal of Symbolic Computation 41 (2006) 151-163 | |
| dc.identifier | doi:10.1016/j.jsc.2005.04.007 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/97820 | |
| dc.subject | Combinatorics | |
| dc.title | Viterbi Sequences and Polytopes | |
| dc.type | text |