A Markov chain on the state-space I={1,2,3,4,5,6,7} has transition matrix
P=⎝⎜⎜⎜⎜⎜⎜⎜⎜⎜⎛01/3000001/20000001/41/20100000100001/4000001/201/6001000000011/2⎠⎟⎟⎟⎟⎟⎟⎟⎟⎟⎞
Classify the chain into its communicating classes, deciding for each what the period is, and whether the class is recurrent.
For each i,j∈I say whether the limit−1limn→∞pij(n) exists, and evaluate the limit when it does exist.