The entrance probability theorem shows that if we start from a position say i then the probability of arriving at another position say j for the first time within a time period n is f_{ij}^{(n) }

The equation thus becomes:

= P [ X_{n}_{ }= j, X_{n-1}_{ }≠ j, X_{n-2}_{ }≠ j. … X_{1} ≠ j| X_{0} = i]

Now suppose we have T_{ij} =Min {n :X_{n} = j | X0 = i}:

Thus we see if n=1 the, f_{ij}^{(1)}= p_{ij.}

Then from the above expressions we get the result:

There is two type of states which we can get from the above result as:

- f
_{ii}< 1= transient state. - fii = 1 = recurrent state.

Lastly we come to the need of taking out the average recurrence time i.e. the time taken by the state to return back to its initial position. The equation is:.