A time-homogeneous Markov chain on a countable state space is a sequence of -valued random variables for which, for every positive-probability finite history,
Thus the conditional next-step law depends only on the current state, and the transition probabilities do not depend on time.
The transition matrix is , where . Its entries are nonnegative and each row sums to one. On states absent from a particular initial law, these probabilities specify the same chain when started from that state.
For , the transition probabilities are the entries of the identity . Suppose the formula holds for . Conditioning on and using the Markov property gives
The countable sums have nonnegative terms, so they are justified by the law of total probability. Induction proves
Conditioning on the initial state gives
Thus the row-vector distribution at time is .
If , induction gives for every . Part (c) then makes the distribution of every equal to . Such a probability row vector is a stationary distribution.
For , the stationarity equation is
which rearranges to the stated recurrence. At zero,
Define the adjacent probability current . The recurrence says , and the boundary equation says . Hence for all . Since , normalization gives
The adjacent balance equations also verify stationarity directly. If , this formula means the point mass at zero; otherwise the birth-death chain is irreducible and this is its unique stationary probability distribution.
Let . For , the chain is irreducible and its stationary probability distribution makes it positive recurrent. The mean-return-time identity gives
This counts a self-loop at zero as a return after one time unit, as “next zero” requires. Equivalently, with probability that immediate return occurs; with probability the chain moves to one and then has mean hitting time back to zero, giving . If , the return is deterministically at time one and the displayed formula still equals one.

Articles by others on the same topic (0)

There are currently no matching articles.