Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T20:12:13.266Z Has data issue: false hasContentIssue false

On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network

Published online by Cambridge University Press:  01 July 2016

Arie Hordijk
Affiliation:
University of Leiden
Flora Spieksma*
Affiliation:
University of Leiden
*
∗ The research of this author was supported by the Netherlands Organisation for Scientific Research N.W.O.

Abstract

This paper gives an overview of recurrence and ergodicity properties of a Markov chain. Two new notions for ergodicity and recurrence are introduced. They are called μ -geometric ergodicity and μ -geometric recurrence respectively. The first condition generalises geometric as well as strong ergodicity. Our key theorem shows that μ -geometric ergodicity is equivalent to weak μ -geometric recurrence. The latter condition is verified for the time-discretised two-centre open Jackson network. Hence, the corresponding two-dimensional Markov chain is μ -geometrically and geometrically ergodic, but not strongly ergodic. A consequence of μ -geometric ergodicity with μ of product-form is the convergence of the Laplace-Stieltjes transforms of the marginal distributions. Consequently all moments converge.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1992 

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