79 views2 pages
30 Jan 2019
School
Department
Course

Document Summary

Math 303 assigment 1: due wednesday, january 16 at start of class: problems to be handed in, a markov chain {xn, n 0} with state space s = {0, 1, 2} has transition probability matrix. If p(x0 = 0) = p(x0 = 1) = 0. 4 and p(x0 = 2) = 0. 2, nd the distribution of x2 and evaluate p[x2 < x4]: we ip a fair coin 5 times. Let a be the event that at least one t was ipped immediately after an h (i. e. the combination ht appears at least once in your sequence of ips). Write down the transition matrix p , and express p(a) in terms of p 5: a spider hunts a y moving between the positions 1 and 2 according to a markov chain with transition matrix. The y, independently of the spider, moves between 1 and 2 according to a second markov.