Science:Math Exam Resources/Courses/MATH307/April 2012/Question 08 (c)
Work in progress: this question page is incomplete, there might be mistakes in the material you are seeing here.
• Q1 (a) • Q1 (b) • Q1 (c) • Q1 (d) • Q2 (a) • Q2 (b) • Q2 (c) • Q3 • Q4 (a) • Q4 (b) • Q4 (c) • Q4 (d) • Q4 (e) • Q5 (a) • Q5 (b) • Q5 (c) • Q6 (a) • Q6 (b) • Q6 (c) • Q6 (d) • Q7 (a) • Q7 (b) • Q7 (c) • Q8 (a) • Q8 (b) • Q8 (c) •
Question 08 (c) 

Consider the stochastic matrix (c) What is ? Give a reason. 
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! 
Hint 

Science:Math Exam Resources/Courses/MATH307/April 2012/Question 08 (c)/Hint 1 
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.

Solution 

Found a typo? Is this solution unclear? Let us know here.
Please rate my easiness! It's quick and helps everyone guide their studies. Regardless, of the initial vector ( in this case), the probability vector found from will converge to the eigenvector with the eigenvalue pair of 1 scaled by a constant such that the sum of the elements in the vector sums to 1. It was found in part (a) the following is this particular eigenvalue/vector pair:
Therefore, we want to scale the vector to have the three elements sum to 1. We can do that easily using basic algebra:
Therefore, the would converge to the matrix:
Note: Another way you can look at this is that we are using the power method to converge towards the eigenvector with the largest absolute eigenvalue. We already showed in (b) that there would be no eigenvalue greater than 1. Therefore, if we keep multiplying by P and normalize the vector every time, we would converge to the eigenvector (Notice that we don’t actually have to normalize it every time since a stochastic matrix will already cause the values of the matrix to sum to 1). Lastly, we know that any constant multiple of the eigenvector is still the same eigenvector, therefore we can scale to what the answer that we found above. 