On weak lumpability of denumerable Markov chains

James Ledoux 1
1 MODEL - Modeling Random Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We consider weak lumpability of denumerable discrete or continuous time Markov chains. Firstly, we are concerned with irreducible recurrent positive and R-positive Markov chains evolving in discrete time. We study the properties of the set of all initial distributions of the starting chain leading to an aggregated homogeneous Markov chain with respect to a partition of the state space. In particular, the asymptotic interpretation of the quasi-stationary distribution is addressed and it is fruitfully used for weak lumpability of R-positive Markov chains. Furthermore, we present a simple example which shows that a denumerable Markov chain can be (weakly) lumped into a finite Markov chain. Finally, it is stated that weak lumpability for any continuous time Markov chain with an uniform transition semi-group can be handled in discrete time context. The sequel of this result are also discussed for irreducible positive-recurrent or λ-positive continuous time Markov chains.
Type de document :
[Research Report] RR-2221, INRIA. 1994
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:19:19
Dernière modification le : vendredi 16 novembre 2018 - 01:30:11
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:17:35



  • HAL Id : inria-00074449, version 1


James Ledoux. On weak lumpability of denumerable Markov chains. [Research Report] RR-2221, INRIA. 1994. 〈inria-00074449〉



Consultations de la notice


Téléchargements de fichiers