Hw4-ORIE3510_S12_solns - ORIE 3510 Homework 4 Solutions...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ORIE 3510 Homework 4 Solutions Instructor: Mark E. Lewis due 2PM, Wednesday February 22, 2012 (ORIE Hallway drop box) 1. If p ij were (strictly) positive, then p ( n ) ji would be 0 for all n (otherwise, i and j would communicate). But then the process, starting in i , has a positive probability of at least p ij of never returning to i . This contradicts the recurrence of i . Hence p ij = 0. 2. a) The classes are { 1 , 2 , 6 , 9 } , { 3 , 4 , 7 } and { 5 , 8 } b) { 1 , 2 , 6 , 9 } and { 3 , 4 , 7 } are recurrent. { 5 , 8 } is transient. 1/2 1/2 3 1 1/2 1 2 7 1 4 1 1 2/3 3/4 1/2 6 9 8 1 1/3 5 1/4 c) Let d ( i ) denote the period of state i . We have that d (1) = d (2) = d (6) = d (9) = 4 d (3) = d (4) = d (7) = 1 d (5) = d (8) = 2 3. If M i =0 p ij = 1 for all i , then j = 1 / ( M + 1) satisfies j = M X i =0 i p ij and M X j =0 j = 1 . 1 Since the chain is irreducible and aperiodic, there is a unique nonnegative solution to the steady state equation. That is, j given as above is the limiting probabilities and...
View Full Document

This note was uploaded on 03/08/2012 for the course ORIE 3510 taught by Professor Resnik during the Spring '09 term at Cornell University (Engineering School).

Page1 / 3

Hw4-ORIE3510_S12_solns - ORIE 3510 Homework 4 Solutions...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online