This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Z 1 W(t)dW(t). Question 4(20 marks). Suppose an urn contains 10 red balls and 5 white balls. One ball is selected after another without replacements. Let {Xn, n = 1, 2, . .., 15} denote the colour of the nth ball that is selected. Show that the random process is not a Markov chain. Question 5(20 marks). A man either passes the Saigon bridge or the Binh trieu bridge to work each day. Suppose that he never passes the Saigon bridge two days in a row; but if he passes the Binh Trieu bridge one day, then the next day he is just as likely to pass the Binh trieu bridge again as he is to pass the Saigon bridge. (a) Describe the Markov chain and its transition matrix. (b) What is the percentage of time, in the long run, the man in question passes the Saigon bridge ?...
View
Full
Document
This note was uploaded on 10/28/2009 for the course MATH ma024 taught by Professor Thu during the Spring '09 term at Vienna EBA.
 Spring '09
 thu
 Probability

Click to edit the document details