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

DOI10.2307/3214258zbMath0622.60075OpenAlexW4256006883MaRDI QIDQ3759644

Linn I. Sennott

Publication date: 1987

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214258

zbMATH Keywords

computer communicationclassification criteriairreducible and aperiodic

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Stochastic matrices (15B51) Theory of software (68N99)

Related Items (3)

Mathematical theory of queueing networks ⋮ Inverse problems for ergodicity of Markov chains ⋮ A Simple Proof of Instability of a Random-Access Communication Channel

This page was built for publication: Conditions for the non-ergodicity of Markov chains with application to a communication system