Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T04:19:57.315Z Has data issue: false hasContentIssue false

Conditions for the non-ergodicity of Markov chains with application to a communication system

Published online by Cambridge University Press:  14 July 2016

Linn I. Sennott*
Affiliation:
Illinois State University
*
∗ Postal address: Department of Mathematics, Illinois State University, Normal, IL 61761, USA.

Abstract

We obtain a sufficient condition for the transience of a Markov chain, and a sufficient condition for its null recurrence. These are applied to characterize the stability of a multiple-access communication system. Performance bounds for the system are also obtained.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1987 

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