This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: EE 465 : Homework 5 Solutions 1. As the hint suggests, define a state as what had happened in the last 3 days. Then, we have 8 states, namely { ( RRR ) , ( RRD ) , ( RDR ) , ( RDD ) , ( DRR ) , ( DRD ) , ( DDR ) , ( DDD ) } where D = dry and R = rain. For instance, ( DDR ) means that it is raining today, was dry yesterday and was dry the day before yesterday. 2. This is not a markov chain because transition probability is different for different n . This may be transformed to a markov chain by enlarging the state space to S = , 1 , 2 , , 1 , 2 where state i ( i ) signifies that the present value is i , and the present day is even (odd). 3. Proof by induction: For n = 1, P (1) = 1 2 + 1 2 (2 p 1) 1 2 1 2 (2 p 1 1 2 1 2 (2 p 1) 1 2 + 1 2 (2 p 1) = p 1 p 1 p p = P For n &gt; 1, P ( n +1) = p 1 p 1 p p 1 2 + 1 2 (2 p 1) n 1 2 1 2 (2 p 1) n 1 2 1 2 (2 p 1) n 1 2 + 1 2 (2 p 1) n = a b b a (Since we know that the matrix is symmetric). a = p 1 2 + 1 2 (2 p 1) n +(1 p ) 1 2 1 2 (2 p 1) n = 1 2 ( p + p (2 p 1) n + 1 p (1 p )(2 p 1) n...
View
Full
Document
This note was uploaded on 08/05/2009 for the course EE 465 taught by Professor Chow during the Fall '04 term at USC.
 Fall '04
 Chow

Click to edit the document details