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

1987 ◽  
Vol 24 (2) ◽  
pp. 339-346 ◽  
Author(s):  
Linn I. Sennott

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.

1987 ◽  
Vol 24 (02) ◽  
pp. 339-346 ◽  
Author(s):  
Linn I. Sennott

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.


1976 ◽  
Vol 13 (02) ◽  
pp. 357-360
Author(s):  
Pedro Vit

It is shown that an irreducible and aperiodic Markov chain can be altered preserving irreducibility without altering the nature of the chain in the sense that, the modified chain is transient (recurrent) if and only if the original chain is transient (recurrent). Furthermore, it is shown by means of a counterexample that ergodicity (null-recurrence) is not preserved. An interesting application of this result is a simple proof of Pakes's generalization of Foster's criterion for a chain to be recurrent.


Sign in / Sign up

Export Citation Format

Share Document