IE 325: Stochastic Models Homework Assignment 2: Fall 2015 Due: October 12, 17:00
IE 325: Stochastic Models Homework Assignment 2: Fall 2015 Due: October 12, 17:00
Homework Assignment 2
Fall 2015
Due: October 12, 17:00
Question 1. Consider the Markov chain defined recursively by:
(
Xn + n+1 ,
if Xn + n+1 2
Xn+1 =
Xn + n+1 3, if Xn + n+1 3.
Where 1 , 2 , . . . are independent identically distributed random variables and,
P {i = 0} = p0 , P {i = 1} = p1 , P {i = 2} = p2 ,
p0 > 0, p1 > 0, p2 > 0, p0 + p1 + p2 = 1 and X0 = 0.
(a) Is X = (Xn )n0 a Markov chain? Explain briefly.
(b) What are the states of the Markov chain?
(c) Determine the one step transition probability matrix P.
Question 2. Consider the Markov chain with one-step transition probability matrix:
0
1
0 1/2 1/2
P =
1 1/4 3/4
Question 3. Markov chains are used to model speech. Consider saying the word beer.
Different people might make the phonemes b, ee, r longer or shorter, depending on
the speaker and where the emphasis is put. To model this, speaking the word beer is
considered to be a Markov chain on the state space E = {b, ee, r, .} with the
following transition matrix:
0.9
0
P =
0
0
0.1
0
0
0.99 0.01
0
.
0
0.95 0.05
0
0
1
(a) What is the expected amount of time it takes to reach the end of the word .?
(b) What is the probability that after three units of time, you have not yet finished enunciating the first phoneme b?
Question 4. A teacher has two coats. He does not want to get sick while going to school
and coming back to home during cold winter days. If the weather is cold and a coat is
available, he puts on it. If the weather is nice, he does not wear coat. The probability that
the weather is cold at any time is p, independent from everything else.
(a) Model the process as a Markov chain and calculate one-step transition probability
matrix P .
(b) If the teacher has one coat in his home this morning, what is the probability that,
tomorrow evening, he will have one coat in his office before leaving?
Question 5. A Markov Chain (Xn )n0 has the transition probability matrix:
0
1
2