A Functional Central Limit Theorem for a Markov-Modulated Infinite-Server Queue - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Methodology and Computing in Applied Probability Année : 2016

A Functional Central Limit Theorem for a Markov-Modulated Infinite-Server Queue

Résumé

The production of molecules in a chemical reaction network is modelled as a Poisson process with a Markov-modulated arrival rate and an exponential decay rate. We analyze the distribu-tional properties of M , the number of molecules, under specific time-scaling; the background process is sped up by N α , the arrival rates are scaled by N , for N large. A functional central limit theorem is derived for M , which after centering and scaling, converges to an Ornstein-Uhlenbeck process. A dichotomy depending on α is observed. For α ≤ 1 the parameters of the limiting process contain the deviation matrix associated with the background process.
Fichier principal
Vignette du fichier
1309.3962.pdf (370.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01426312 , version 1 (04-01-2017)

Identifiants

Citer

D Anderson, J Blom, M Mandjes, H Thorsdottir, K de Turck. A Functional Central Limit Theorem for a Markov-Modulated Infinite-Server Queue. Methodology and Computing in Applied Probability, 2016, 18, pp.153 - 168. ⟨10.1007/s11009-014-9405-8⟩. ⟨hal-01426312⟩
57 Consultations
136 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More