(i) Let (Xn,Yn)n⩾0 be a simple symmetric random walk in Z2, starting from (0,0), and set T=inf{n⩾0:max{∣Xn∣,∣Yn∣}=2}. Determine the quantities E(T) and P(XT=2 and YT=0).
(ii) Let (Xn)n⩾0 be a discrete-time Markov chain with state-space I and transition matrix P. What does it mean to say that a state i∈I is recurrent? Prove that i is recurrent if and only if ∑n=0∞pii(n)=∞, where pii(n) denotes the (i,i) entry in Pn.
Show that the simple symmetric random walk in Z2 is recurrent.