= Recurrent Markov chain
{wiki}
= Markov-chain recurrence
{c}
{synonym}
= Recurrent
{synonym}
= Recurrence
{synonym}
A <Recurrent Markov chain> returns to its states rather than eventually leaving them forever. A state $i$ is <recurrent Markov chain>[recurrent] if its <first return time>[positive first return time] $T_i^+=\inf\{n\geq1:X_n=i\}$ satisfies $\mathbb P_i(T_i^+<\infty)=1$. A chain is <recurrent Markov chain>[recurrent] when every state is <recurrent Markov chain>[recurrent]. Within an <communicating class>[irreducible class], <recurrence> is shared by every state, so testing one state suffices.
The <Strong Markov property> at successive return times shows that a <Recurrent state> is visited infinitely often <almost surely> when starting there. If its return <Probability> is $f_i<1$, the number of visits including time zero has a <geometric distribution> on the positive <integer>[integers], with <mean> $1/(1-f_i)$. Consequently the Green-function criterion is
$$
i\text{ is recurrent}\quad\Longleftrightarrow\quad
\sum_{n=0}^\infty P^n(i,i)=\infty.
$$
<Tonelli theorem>[Tonelli's theorem] identifies this sum with the expected number of visits. <recurrence> does not require a finite <mean recurrence time>[mean return time]: <null recurrent Markov chain>[null recurrence] and <positive recurrence> distinguish infinite from finite <mean recurrence time>. <simple symmetric random walk> on the <integer>[integers] is <null recurrent Markov chain>[null recurrent], whereas every finite <irreducible Markov chain>[irreducible] chain is <positive recurrent Markov chain>[positive recurrent].
Back to article page