We have characterized recurrence in terms of return times. However, if a Markov chain is positive recurrent, what proportion of time does it spend in each state?
Theorem. For an irreducible positive recurrent Markov chain, there exists a probability distribution such that for all
Moreover, is the unique solution to the full balance equations
Conversely, if the full balance equations have a solution, then the Markov chain is positive recurrent.
The distribution is stationary in the sense that
- When the above convergence holds, the chain is called ergodic.
- The distribution
is called the stationary (or equilibrium) distribution.
- The full balance equations can also be written as
This can be interpreted as: the proportion of time entering state equals the proportion of time leaving
.

Figure: flow of probability into and out of a state.
Reversibility
Instead of full balance, we may require that transitions between each pair of states balance. This is called detailed balance.
Definition. A distribution satisfies detailed balance if
- Detailed balance implies full balance, and hence gives a stationary distribution.
- It is often easier to verify detailed balance than full balance.
- Many Markov chains (especially in Monte Carlo methods) are designed to be reversible.
Definition (Time reversal and reversibility). For a Markov chain , define the reversed process
The chain is reversible if and
have the same distribution.
Theorem. A Markov chain is reversible if and only if it satisfies the detailed balance equations.
Discrete-time single-server queue (continued)
For the discrete-time single-server queue, it is easier to verify detailed balance.

Figure: transition structure of the queue.
We have
so
To normalize, we require
which gives
Hence
Thus, the stationary distribution is geometric. Many queueing systems with fixed service rates exhibit this geometric structure.