For a state of a Markov chain, its period is the greatest common divisor of the positive return lengths,A state is periodic when . All states in an irreducible class have the same period: paths connecting two states transfer return cycles between them. A reducible chain can have classes of different periods, so a single period for the whole chain requires qualification.
The deterministic two-state chain has period two: its distributions alternate forever despite the existence of the uniform Stationary distribution. More generally, an irreducible nearest-neighbour walk on a bipartite graph alternates its two vertex classes. A positive holding probability at any state of an irreducible class supplies a one-step return and makes the entire class aperiodic. Aperiodicity therefore concerns possible return lengths rather than merely the existence of an invariant law.
Suppose a Markov chain leaves transient states and enters a closed two-state class which alternates deterministically. If entry is always into the first state, let and be the probabilities of entering at even and odd times. After the probability of still being transient tends to zero, the even-time probabilities at the two recurrent states tend to , while the odd-time probabilities tend to . Individual limits therefore exist exactly when . A periodic recurrent class can thus have convergent state probabilities from particular transient starting states even though convergence fails from its own states.
// Target: geometry-and-topology.bigb
Articles by others on the same topic
There are currently no matching articles.