Bounded state space truncation and Censored Markov chains - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Bounded state space truncation and Censored Markov chains

Résumé

Markov chain modeling often suffers from the curse of dimensionality problems and many approximation schemes have been proposed in the literature that include state-space truncation. Estimating the accuracy of such methods is difficult and the resulting approximations can be far from the exact solution. Censored Markov chains (CMC) allow to represent the conditional behavior of a system within a subset of observed states and provide a theoretical framework to study state-space truncation. However, the transition matrix of a CMC is in general hard to compute. Dayar et al. (2006) proposed DPY algorithm, that computes a stochastic bound for a CMC, using only partial knowledge of the original chain. We prove that DPY is optimal for the information they take into account. We also show how some additional knowledge on the chain can improve stochastic bounds for CMC.
Fichier non déposé

Dates et versions

hal-00835445 , version 1 (18-06-2013)

Identifiants

Citer

Ana Bušić, Hilal Djafri, Jean-Michel Fourneau. Bounded state space truncation and Censored Markov chains. CDC - 51st IEEE Conference on Decision and Control - 2012, Dec 2012, Maui, Hawaii, United States. pp.5828-5833, ⟨10.1109/CDC.2012.6426156⟩. ⟨hal-00835445⟩
287 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More