Papers
Topics
Authors
Recent
2000 character limit reached

Stability of a Markov-modulated Markov Chain, with application to a wireless network governed by two protocols (1105.0270v2)

Published 2 May 2011 in math.PR

Abstract: We consider a discrete-time Markov chain $(Xt,Yt)$, $t=0,1,2,...$, where the $X$-component forms a Markov chain itself. Assume that $(Xt)$ is Harris-ergodic and consider an auxiliary Markov chain ${\hat{Y}t}$ whose transition probabilities are the averages of transition probabilities of the $Y$-component of the $(X,Y)$-chain, where the averaging is weighted by the stationary distribution of the $X$-component. We first provide natural conditions in terms of test functions ensuring that the $\hat{Y}$-chain is positive recurrent and then prove that these conditions are also sufficient for positive recurrence of the original chain $(Xt,Yt)$. The we prove a "multi-dimensional" extension of the result obtained. In the second part of the paper, we apply our results to two versions of a multi-access wireless model governed by two randomised protocols.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.