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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4009472
Language Label Description Also known as
default for all languages
No label defined
    English
    Conditions for the non-ergodicity of Markov chains with application to a communication system
    scientific article; zbMATH DE number 4009472

      Statements

      Conditions for the non-ergodicity of Markov chains with application to a communication system (English)
      0 references
      0 references
      1987
      0 references
      irreducible and aperiodic
      0 references
      classification criteria
      0 references
      computer communication
      0 references
      Let \(X_ n\) be a Markov chain with state space \(\{\) 0,1,..\(\}\) and transition matrix \(P=[P(i,j)]\), assumed irreducible and aperiodic. Then either all states are positive recurrent, or all are null recurrent, or all are transient. For each i let \(\psi_ i(z)=[z^ i- \sum_{j}P(i,j)z^ j]/(1-z)\), \(z\in (0,1)\), and for each i and n define the generalized drift \[ \gamma_ i^{(n)}=\sum_{j}P(i,j)[j(j- i)...(j-n)-i(i-1)...(i-n)]. \] Let n be fixed and assume that \(\gamma_ i^{(n)}<\infty\) for each i. The author adds to the repertoire of classification criteria by showing that if there exist \(C\in (0,1)\) and positive integers B, N such that \(\gamma_ i^{(n)}\geq 0\) for \(i\geq N\) and \(i^ n\psi_ i(z)\geq -B\) for \(i\geq N\) and \(z\in (C,1)\), then all states are either recurrent null or transient. If in addition \(\gamma_ i\leq 0\) for \(i\geq N\), then all states are recurrent null. Application is made to the ALOHA protocol for computer communication.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references