Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T13:28:03.968Z Has data issue: false hasContentIssue false

A functional central limit theorem for the jump counts of Markov processes with an application to Jackson networks

Published online by Cambridge University Press:  01 July 2016

Venkat Anantharam*
Affiliation:
Cornell University
Takis Konstantopoulos*
Affiliation:
University of Texas at Austin
*
* Present address: EECS Department, University of California, Berkeley, CA 94720, USA.
** Postal address: Department of Electrical and Computer Engineering, University of Texas, TX 78712, USA.

Abstract

Each feasible transition between two distinct states i and j of a continuous-time, uniform, ergodic, countable-state Markov process gives a counting process counting the number of such transitions executed by the process. Traffic processes in Markovian queueing networks can, for instance, be represented as sums of such counting processes. We prove joint functional central limit theorems for the family of counting processes generated by all feasible transitions. We characterize which weighted sums of counts have zero covariance in the limit in terms of balance equations in the transition diagram of the process. Finally, we apply our results to traffic processes in a Jackson network. In particular, we derive simple formulas for the asymptotic covariances between the processes counting the number of customers moving between pairs of nodes in such a network.

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1995 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable