Elements Of Applied Probability For Engineering, Mathematics And Systems Science

Consider an irreducible, recurrent Markov chain X n and consider some subset A in the state space. If we watch the chain X n only when it returns to A, we obtain the process watched on A. More precisely define ? A( n) to be the n th return time to A = where ? A(0) = 0. Let W n = X ? A( n). Take i, j ? A. Take Y = ?{ X ? A(1) = j} so
since the shift ? ? A( n) cuts off the trajectory of X before time ? A( n). By Theorem 5.58, with ? taken to be ? A( n),

Hence, conditioning on the event { W 0 = i 0, , W n ?1 = i n ?1, W n = i} we get
This means the process W n is a Markov chain with a stationary transition kernel.
We next examine the transition kernel AK for the process on A. Define
which gives the probability, starting in i, of hitting j (which may or may not be in A) on the m th step, having stayed in A c in the preceding steps. Next extend the definition...