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.

Finite Irreducible Sets<br />

.<br />

Corollary<br />

.<br />

.Finite irreducible sets consist of positive recurrent states only.<br />

Proof: Let C be a finite irreducible set. That is,<br />

▶ For any i ∈ C it holds that ∑<br />

j∈C pij = 1; thus, also for all n, ∑<br />

j∈C p(n) ij = 1;<br />

▶ All states in C communicate;<br />

▶ All states have the same classification;<br />

Suppose transient or nulrecurrent, then all πj = 0. Gives a contradiction:<br />

0 = ∑<br />

πj = ∑ (<br />

j∈I<br />

j∈I<br />

finite set ∑ 1<br />

= lim<br />

n→∞ n<br />

j∈I<br />

lim<br />

n→∞<br />

n∑<br />

k=1<br />

1<br />

n<br />

n∑<br />

k=1<br />

p (k)<br />

ij<br />

p (k)<br />

)<br />

ij<br />

1<br />

= lim<br />

n→∞ n<br />

n∑ ∑<br />

c⃝ Ad Ridder (VU) SOR– Fall 2012 20 / 36<br />

k=1<br />

j∈I<br />

p (k)<br />

ij<br />

= 1

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

Saved successfully!

Ooh no, something went wrong!