We consider a discrete-time Markov chain (Xn, Yn), where the X-component forms a Markov chain itself. Assuming that (Xn) is ergodic, we formulate the following "naive" conjecture. Consider an auxiliary Markov chain 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. The conjecture is: if the this chain is positive recurrent, then so is the (X, Y)-chain. We first show that, under appropriate technical assumptions, such a general result indeed holds, and then apply it to two versions of a multi-access wireless model governed by two randomised protocols.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
