Hello, please use Markov process for the problem. Please make the explanations simple and understandable, I don't have a statistics background. Thank you!
a.
The state transition diagram of the process is,
b.
The state transition diagram of the process is,
c.
Probability that Mark is cheerful on Wednesday given he was so-so on Monday
= P(X2 = 1 | X0 = 2)
= P(X0 = 2, X1 = 1, X2 = 1) + P(X0 = 2, X1 = 2, X2 = 1) + P(X0 = 2, X1 = 3, X2 = 1)
= 0.3 * 0.6 + 0.5 * 0.3 + 0.2 * 0
= 0.33
Probability that Mark is cheerful on Friday given Mark is cheerful on Wednesday
= P(X2 = 1 | X0 = 1)
= P(X0 = 1, X1 = 1, X2 = 1) + P(X0 = 1, X1 = 2, X2 = 1) + P(X0 = 1, X1 = 3, X2 = 1)
= 0.6 * 0.6 + 0.2 * 0.6 + 0.2 * 0
= 0.48
Probability that Mark is glum on Sunday given Mark is cheerful on Friday
= P(X2 = 3 | X0 = 1)
= P(X0 = 1, X1 = 1, X2 = 3) + P(X0 = 1, X1 = 2, X2 = 3) + P(X0 = 1, X1 = 3, X2 = 3)
= 0.6 * 0.2 + 0.2 * 0.2 + 0.2 * 0.5
= 0.26
Probability that Mark is cheerful on Wednesday and Friday and glum on Sunday given he was so-so on Monday
= Probability that Mark is cheerful on Wednesday given he was so-so on Monday * Probability that Mark is cheerful on Friday given Mark is cheerful on Wednesday * Probability that Mark is glum on Sunday given Mark is cheerful on Friday
= 0.33 * 0.48 * 0.26
= 0.041184
d.
Let = [a, b, c] be the steady state vector where a, b and c are the long run proportion of time Mark is in three modes.
Then P =
and a + b + c = 1
which gives,
0.6a + 0.3b = a => -0.4a + 0.3b = 0
0.2a + 0.5b + 0.5c = b => 0.2a - 0.5b + 0.5c = 0
0.2a + 0.2b + 0.5c = c => 0.2a + 0.2b - 0.5c = 0
and a + b + c = 1
Solving these equations we get,
a = 0.3061224, b = 0.4081633 c = 0.2857143
Hello, please use Markov process for the problem. Please make the explanations simple and understandable, I don't have a statistics background. Thank you! 4.10 On a given day Mark is cheerful, so...
On any given day Gary is either cheerful (C), so-so (S), or glum (G). If he is cheerful today, then he will be C, S, or G tomorrow with respective probabilities 0.5,0.4,0.1 . If he is feeling so-so today, then he will be \(C\), S, or G tomorrow with probabilities \(0.3,0.4,0.3 .\) If he is glum today, then he will be \(\mathrm{C}, \mathrm{S},\) or \(\mathrm{G}\) tomorrow with\(X_{n}\) denote Gary's mood on the nth day, then \(\left\{X_{n}, n \geq 0\right\}\) is...
Hello, please use Markov process for the problem. Please make the explanations simple and understandable, I don't have a statistics background. Thank you! 4.3 A taxi driver conducts his business in three different towns 1, 2, and 3. On any given day, when he is in town 1, the probability that the next passenger he picks up is going to a place in town 1 is 0.3, the probability that the next passenger he picks up is going to town...