How do we prove that a state in a Markov chain process is positive recurrent, zero recurrent or transient? For example, if we have a transition matrix
$$P=\left(\begin{array}{ccc} \frac{1}{3} & \frac{1}{3} & \ 0 & \frac{1}{3} \\ 0 & \frac{1}{2} & \frac{1}{2} & 0\\ \frac{1}{2} & \ 0 & 0 & \frac{1}{2} \\ 0 & \frac{1}{3} & \frac{1}{3} & \frac{1}{3} \end{array}\right)$$
how do we do it??
Thanks a lot!!
If the state space is finite, start by dividing the state space into communicating classes.
Now check each class:
There are no null recurrent states.