This preview shows pages 1–3. 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: ECE 496 SOLUTIONS TO HOMEWORK ASSIGNMENT III Spring 2007 1. Markov chains are not only extraordinarily useful but also fun to play with. (a) The transition matrix P is defined by [ P ] ij = Prob { i j in one step } , so P = 2 4 1 / 2 1 / 6 1 / 3 1 / 3 1 / 2 1 / 6 2 / 3 1 / 6 1 / 6 3 5 . The stationary distribution * is the unique row vector [ * i * 2 * 3 ] with nonnega tive entries summing to 1 that satisfies * P = * . Simple algebra (four equations in three unknowns, etc.) yields * = 1 / 2 1 / 4 1 / 4 . (b) The indicated Markov chain, which is a random walktype chain, will have transition matrix Q = 2 4 q 11 q 12 q 21 q 22 q 23 q 32 q 33 3 5 . To guarantee that this chain has stationary distribution * from (a), it suffices to make sure that the q s satisfy the detailedbalance conditions * i q ij = * j q ji for all i and j . There are many ways to make this happen. The conditions hold if q 12 /q 21 = 1 / 2 and q 23 = q 32 . So lets find and so that Q = 2 4 1 2 1 2  1 3 5 ; we need to make sure all the entries in Q are nonnegative as well. One choice is = 1 / 4 and = 1 / 2, which means that Q = 2 4 3 / 4 1 / 4 1 / 2 1 / 4 1 / 4 1 / 4 3 / 4 3 5 . You can check that * Q = * for our given * . 2. Its easy to do a complete analysis for a trivial example such as this one, but I dare you to try an example with longer strings and bigger populations. (a) The possible populations are { , } , { , 1 } , and { 1 , 1 } . Lets be boring and call them 1, 2, and 3, respectively. (b) See the accompanying diagram. (c) For Population 1, the parents for the next generation are always 0 and 0, so mutation is the only thing that can change Population 1 into another. 1 changes to 3 if and only if both parents mutate, which occurs with probability . 0001. 1 changes to 2 if and only if exactly one of the parents mutates, which occurs with probability 2( . 99)( . 01) = . 0198. 1 goes to 1 if and only if neither parent mutates, which happens with probability . 99 2 = . 9801. The situation with Population 3 is similar. The parents are always 1 and 1, mutation is the only change agent, 1 and 3 goes to 1 with probability . 0001, to 2 with probability . 0198, and to 3 with probability . 9801. As for Population 2, any pair of parents for the next generation is possible. Lets call A the set of parents 0 and 0; B the set of parents 0 and 1; and C the set of parents 1 and 1. Because of fitnessproportional selection, A occurs with probability 1 / 36, B with probability 10 / 36, and C with probability 25 / 36. Using the standard notation, denote by p 21 the probability that Population 1 arises as the next generation. Then p 21 = (1 / 36)Prob(1  A ) + (10 / 36)Prob(1  B ) + (25 / 36)Prob(1  C ) , where, e.g., the term Prob(1  A ) means the probability that Population 1 arises when the parents are A . Weve computed Prob(1  A ) = . 9801 and Prob(1  C ) = . 0001 already. And Prob(10001 already....
View
Full
Document
 Spring '07
 DELCHAMPS
 Algorithms

Click to edit the document details