The communicating classes are , and . The class is open: it can reach or and cannot be reached from either. To remain in for two steps has probability , so for . Its states are transient states. All returns within have even length and a two-step return is possible, so their period of a state in a Markov chain is .
The closed communicating class alternates deterministically between and , and therefore consists of positive recurrent states of period . The class is finite, closed and irreducible, so its states are also positive recurrent states. The self-loop at gives period there, and the period is constant on a communicating class, so every state of has period .
For , solve the stationary distribution equations:Hence . Finite irreducibility and aperiodicity imply convergence to this stationary distribution from any state of . If is the probability of eventually entering , the Markov property givesso and . Conditioning on the finite entrance time and then letting the remaining time tend to infinity proves that the limiting probabilities in are . The probability of entrance after a large cutoff tends to zero, which justifies this conditioning limit.
For , convergence depends on the parity balance on entry to a period-two Markov class. Entry always occurs at . Starting from , the probabilities of first entry at time and at time are both . Each parity therefore has total probability , so both and tend to , despite the recurrent class being periodic. Starting from , the corresponding odd- and even-entry probabilities are and , with totals and . Consequentlyso neither limit exists. From or , the probabilities at and alternate between zero and one; from they are identically zero. Finally every probability of being in tends to zero, from all starting states.
All requested conclusions are encoded below, with denoting a nonexistent limit:The class classification is : transient, period ; : recurrent, period ; : recurrent, period .
Articles by others on the same topic
There are currently no matching articles.