@article{498502,
  abstract     = {{When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This can be done by considering as basic uncertainty models the so-called credal sets that these probabilities are known or believed to belong to, and by allowing the probabilities to vary over such sets. This leads to the definition of an imprecise Markov chain. We show that the time evolution of such a system can be studied very efficiently using so-called lower and  upper expectations, which are equivalent mathematical representations of credal sets. We also study how the inferred credal set about the state at time n evolves as n goes to infinity: under quite unrestrictive conditions, it converges to a uniquely invariant credal set, regardless of the credal set given for the initial state. This leads to a non-trivial generalisation of the classical Perron-Frobenius Theorem to imprecise Markov chains.}},
  author       = {{de Cooman, Gert and Hermans, Filip and Quaeghebeur, Erik}},
  issn         = {{1469-8951}},
  journal      = {{PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES}},
  keywords     = {{probability tree,credal set,event tree,imprecise Markov chain,Markov chain,non-linear Perron-Frobenius Theorem,sensitivity analysis,stationarity,lower expectation,upper expectation,regularity,DECISION-PROCESSES,TRANSITION-PROBABILITIES,SET-CHAINS}},
  language     = {{eng}},
  number       = {{4}},
  pages        = {{597--635}},
  title        = {{Imprecise Markov chains and their limit behavior}},
  url          = {{http://doi.org/10.1017/S0269964809990039}},
  volume       = {{23}},
  year         = {{2009}},
}

Altmetric

View in Altmetric

Web of Science

Times cited: