(i) Let (Xn)n⩾0 be a Markov chain on the finite state space S with transition matrix P. Fix a subset A⊆S, and let
H=inf{n⩾0:Xn∈A}.
Fix a function g on S such that 0<g(i)⩽1 for all i∈S, and let
Vi=E[n=0∏H−1g(Xn)∣X0=i]
where ∏n=0−1an=1 by convention. Show that
Vi={1g(i)∑j∈SPijVj if i∈A otherwise.
(ii) A flea lives on a polyhedron with N vertices, labelled 1,…,N. It hops from vertex to vertex in the following manner: if one day it is on vertex i>1, the next day it hops to one of the vertices labelled 1,…,i−1 with equal probability, and it dies upon reaching vertex 1. Let Xn be the position of the flea on day n. What are the transition probabilities for the Markov chain (Xn)n⩾0 ?
(iii) Let H be the number of days the flea is alive, and let
Vi=E(sH∣X0=i)
where s is a real number such that 0<s⩽1. Show that V1=1 and
siVi+1=Vi+si−1Vi
for i⩾1. Conclude that
E(sH∣X0=N)=i=1∏N−1(1+is−1)
[Hint. Use part (i) with A={1} and a well-chosen function g. ]
(iv) Show that
E(H∣X0=N)=i=1∑N−1i1