Analysis of a large number of Markov chains competing for transitions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Systems Science Year : 2014

Analysis of a large number of Markov chains competing for transitions

Abstract

We consider the behavior of a stochastic system composed of several identically distributed, but non independent, discrete-time absorbing Markov chains competing at each instant for a transition. The competition consists in determining at each instant, using a given probability distribution, the only Markov chain allowed to make a transition. We analyze the first time at which one of the Markov chains reaches its absorbing state. When the number of Markov chains goes to infinity, we analyze the asymptotic behavior of the system for an arbitrary probability mass function governing the competition. We give conditions for the existence of the asymptotic distribution and we show how these results apply to cluster-based distributed systems when the competition between the Markov chains is handled by using a geometric distribution.
Fichier principal
Vignette du fichier
article.pdf (277.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00736916 , version 1 (30-09-2012)

Identifiers

Cite

Emmanuelle Anceaume, François Castella, Bruno Sericola. Analysis of a large number of Markov chains competing for transitions. International Journal of Systems Science, 2014, 45 (3), pp.232--240. ⟨10.1080/00207721.2012.704090⟩. ⟨hal-00736916⟩
536 View
399 Download

Altmetric

Share

Gmail Facebook X LinkedIn More