MATH152 April 2011
• QA 1 • QA 2 • QA 3 • QA 4 • QA 5 • QA 6 • QA 7 • QA 8 • QA 9 • QA 10 • QA 11 • QA 12 • QA 13 • QA 14 • QA 15 • QA 16 • QA 17 • QA 18 • QA 19 • QA 20 • QA 21 • QA 22 • QA 23 • QA 24 • QA 25 • QA 26 • QA 27 • QA 28 • QA 29 • QA 30 • QB 1(a) • QB 1(b) • QB 1(c) • QB 2(a) • QB 2(b) • QB 3(a) • QB 3(b) • QB 3(c) • QB 4(a) • QB 4(b) • QB 4(c) • QB 4(d) • QB 5(a) • QB 5(b) • QB 5(c) • QB 6(a) • QB 6(b) • QB 6(c) • QB 6(d) • QB 6(e) •
[hide]Question A 23
|
Questions A22-A24 concern a random walk with three states that has transition matrix
![{\displaystyle \left[{\begin{array}{c c c}8/10&3/10&1/10\\2/10&3/10&7/10\\0&4/10&2/10\end{array}}\right]}](https://wiki.ubc.ca/api/rest_v1/media/math/render/svg/01fb5e443ec1ed0e3701e42f19cc75b912efa8a8)
If the walker starts in state 2, which state will she most likely be in after 2 time steps?
|
Make sure you understand the problem fully: What is the question asking you to do? Are there specific conditions or constraints that you should take note of? How will you know if your answer is correct from your work only? Can you rephrase the question in your own words in a way that makes sense to you?
|
If you are stuck, check the hint below. Consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it!
|
[show]Hint
|
We know that if we start from x then Px gives us the probability of 1 transition. How do we get to two transitions?
|
Checking a solution serves two purposes: helping you if, after having used the hint, you still are stuck on the problem; or if you have solved the problem and would like to check your work.
- If you are stuck on a problem: Read the solution slowly and as soon as you feel you could finish the problem on your own, hide it and work on the problem. Come back later to the solution if you are stuck or if you want to check your work.
- If you want to check your work: Don't only focus on the answer, problems are mostly marked for the work you do, make sure you understand all the steps that were required to complete the problem and see if you made mistakes or forgot some aspects. Your goal is to check that your mental process was correct, not only the result.
|
[show]Solution
|
We are starting in state 2 so there is 100% probability of starting in state 2 and zero elsewhere, therefore our input vector is
![{\displaystyle \mathbf {x} =\left[0,1,0\right].}](https://wiki.ubc.ca/api/rest_v1/media/math/render/svg/0ce943ecd20b05dbfae249180b907eb4eb641873)
If we wanted to know the probabilities for moving one transition we would compute t1 = Px,

However we want to know the probabilities for a second transition. We can think of this as a first transition of our new vector t1. Therefore the second transition probabilities are t1 = P t1,

Therefore, starting in state 2, it is most likely that after two transitions, the person will still be in state 2 since 43/100 is the highest of the three probabilities.
Notice, we could also think of the problem as,

so that if we wanted the nth transition probabilities we'd have tn = Pn x.
|
|
Math Learning Centre
- A space to study math together.
- Free math graduate and undergraduate TA support.
- Mon - Fri: 12 pm - 5 pm in MATH 102 and 5 pm - 7 pm online through Canvas.
|