Sunday, 30 October 2016

probability theory - If τkx is the time of the k-th entrance of a Markov chain into x, then $text P_x[τ_y^k

Let




  • E be at most countable and equipped with the discrete topology and E be the Borel σ-algebra on E

  • X=(Xn)nN0 be a discrete Markov chain with values in (E,E) and distributions (Px)xE

  • τ0x:=0 and τkx:=inf{n>τk1x:Xn=x}
    for xE and kN



Let ϱ(x,y):=Px[τ1y<]=Px[nN:Xn=y].



I want to prove, that Px[τky<]=ϱ(x,y)ϱ(y,y)k1for all kN
using the strong Markov property: Ex[f(Xτ+t)tN0Fτ]=EXτ[fX]
for all xE, σ(X)-stopping times τ and bounded, EN0-measurable f:EN0R.






I want to prove (1) by induction over kN. Since, k=1 is trivial, we only need to care about k1k. Since {τk1y<}{τky<}={τky<}

and {τk1y<}Fτk1y,
we've got Px[τky<]=Ex[1{τk1y<}Px[τky<Fτk1y]],
by definition of the conditional expectation. Now, I think, that we somehow need to apply (2) with τ=τk1y to the red term in order to obtain Ex[1{τk1y<}Px[τky<Fτk1y]]=Ex[1{τk1y<}ϱ(y,y)],
but I can't figure out how I need to choose f.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...