beamer - Vrije Universiteit Amsterdam
beamer - Vrije Universiteit Amsterdam
beamer - Vrije Universiteit Amsterdam
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Probabilistic Averages I<br />
.<br />
Theorem 3.3.1 (first part)<br />
.<br />
For all states j ∈ I<br />
.<br />
1<br />
lim<br />
n→∞ n<br />
n∑<br />
k=1<br />
p (k)<br />
jj<br />
= πj<br />
Proof for recurrent j: apply bounded convergence (see book p. 439)<br />
1<br />
lim<br />
n→∞ n<br />
n∑<br />
k=1<br />
1<br />
= lim<br />
n→∞ n<br />
!<br />
= <br />
[<br />
lim<br />
n→∞<br />
p (k)<br />
jj<br />
n∑<br />
k=1<br />
1<br />
n<br />
1<br />
= lim<br />
n→∞ n<br />
n∑<br />
(Xk = j|X0 = j)<br />
k=1<br />
[{Xk = j|X0 = j}] = lim<br />
n→∞ <br />
n∑<br />
]<br />
{Xk = j|X0 = j}<br />
k=1<br />
Proof for transient j: limn→∞ p (n)<br />
jj<br />
[<br />
1<br />
n<br />
n∑<br />
]<br />
{Xk = j|X0 = j}<br />
k=1<br />
∑ 1 n<br />
= 0 ⇒ limn→∞<br />
n k=1 p(k) jj = 0.<br />
c⃝ Ad Ridder (VU) SOR– Fall 2012 14 / 36