beamer - Vrije Universiteit Amsterdam
beamer - Vrije Universiteit Amsterdam
beamer - Vrije Universiteit Amsterdam
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Equilibrium<br />
Suppose that the Markov chain satisfies the unichain condition with a finite<br />
set of transient states (|T| < ∞). For all states j ∈ I (and arbitrary r ∈ I):<br />
(πP)j = ∑<br />
πipij = ∑ (<br />
!<br />
= lim<br />
n→∞<br />
i∈I<br />
∑<br />
i∈I<br />
1<br />
= lim<br />
n→∞ n<br />
= lim<br />
n→∞<br />
1<br />
n<br />
n∑<br />
n∑<br />
k=1<br />
i∈I<br />
p<br />
k=1<br />
(k+1)<br />
rj<br />
1<br />
( ∑n+1<br />
p<br />
n<br />
k=1<br />
(k)<br />
rj − prj<br />
(<br />
n + 1<br />
= lim<br />
n→∞ n<br />
lim<br />
n→∞<br />
1<br />
n<br />
p (k)<br />
ri pij<br />
1<br />
= lim<br />
n→∞ n<br />
n∑<br />
k=1<br />
1 ∑n+1<br />
= lim<br />
n→∞ n<br />
)<br />
1 ∑n+1<br />
n + 1<br />
k=1<br />
p (k)<br />
rj<br />
k=2<br />
p (k)<br />
)<br />
ri pij<br />
n∑ ∑<br />
k=1<br />
p (k)<br />
rj<br />
i∈I<br />
1<br />
−<br />
n prj<br />
)<br />
= πj<br />
p (k)<br />
ri pij<br />
c⃝ Ad Ridder (VU) SOR– Fall 2012 22 / 36