Local stability in a transient Markov chain

Ivo Adan, Sergey Foss, Seva Shneer, Gideon Weiss

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)
21 Downloads (Pure)


We prove two propositions with conditions that a system, which is described by a transient Markov chain, will display local stability. Examples of such systems include partly overloaded Jackson networks, partly overloaded polling systems, and overloaded multi-server queues with skill based service, under first come first served policy.
Original languageEnglish
Article number108855
JournalStatistics and Probability Letters
Early online date24 Jun 2020
Publication statusPublished - Oct 2020


Dive into the research topics of 'Local stability in a transient Markov chain'. Together they form a unique fingerprint.

Cite this