Within the valid parameter rectangle, suppose and . The chain is then irreducible by part (i). State has a two-step return and a three-step return , both of positive probability. Its period of a state in a Markov chain therefore divides both two and three, hence equals one. Irreducibility gives the same period to every state, so the chain is aperiodic.
If and , every transition goes between the two classes and . Returns must have even length, while has length two. Thus the irreducible chain has period two.
If , the closed communicating class alternates between and . Its states have period two, using the positive two-step returns through . Consequently the chain is not aperiodic, regardless of how the transient state is classified. Combining the cases,
Articles by others on the same topic
There are currently no matching articles.