07.08.2013 Views

beamer - Vrije Universiteit Amsterdam

beamer - Vrije Universiteit Amsterdam

beamer - Vrije Universiteit Amsterdam

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Proper First-Passage Times<br />

.<br />

Corollary<br />

.<br />

fij = 1 if either<br />

(i). i, j ∈ R the same recurrent irreducible set;<br />

(ii). i ∈ T transient, j ∈ R recurrent irreducible set; and fiR = 1.<br />

.<br />

.<br />

Theorem 3.5.7(a)<br />

.<br />

Suppose that the unichain condition holds (see lecture 3) with |T| < ∞; then<br />

. fij = 1 for all i ∈ I and j ∈ R.<br />

Proof for i ∈ T:<br />

1 − fiR = (chain nevers reaches R|X0 = 1)<br />

= ( ∩∞<br />

)<br />

<br />

{Xk ∈ T} X0 = i = lim<br />

n→∞ P<br />

( ∩n<br />

)<br />

<br />

{Xk ∈ T} X0 = i<br />

k=1<br />

= lim<br />

n→∞ P(Xn ∈ T|X0 = i) = lim<br />

n→∞<br />

∑<br />

j∈T<br />

k=1<br />

p (n)<br />

ij<br />

finite sum<br />

=<br />

∑<br />

j∈T<br />

lim<br />

n→∞ p(n) ij<br />

= 0.<br />

c⃝ Ad Ridder (VU) SOR– Fall 2012 7 / 36

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!