Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am under the impression that an irreducible, finite Markov chain is necessarily positive recurrent. How might I show this?

Regards, Jon

share|cite|improve this question
up vote 2 down vote accepted

You are right. What argument is useful for you depends on your definitions and what you've learned about Markov chains so far.

Here is one way to look at it. If $x$ is a null state, then the chain spends very little time in $x$, more precisely, $${1\over n}\sum_{j=1}^n 1_{[X_j=x]}\to 0 \text{ almost surely.} $$ Therefore, for any finite set $F$ of null states we also have $${1\over n}\sum_{j=1}^n 1_{[X_j\in F]}\to 0 \text{ almost surely.} $$

But the chain must be spending its time somewhere, so if the state space itself is finite, there must be a positive state. A positive state is necessarily recurrent, and if the chain is irreducible then all states are positive recurrent.

share|cite|improve this answer
Hi Byron, thanks for the answer. To address your point: I am working with the definition that a state is positive recurrent if its expected return time is finite (implicitly: conditional on state at this state). – JW1986 Feb 8 '13 at 13:14

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.