Back to Understanding Linear Algebra

Markov chains and Google's PageRank algorithm

Stochastic matrices whose steady state is the eigenvector for eigenvalue 1, and the page ranking that this equilibrium produces for a web of links.

Understanding Linear Algebra, Markov chains and Google's PageRank algorithm

Status
FlagsLoading your progress…

6 exercises

Exercise 3

Determine whether the following statements are true or false and provide a justification of your response.

  1. Every stochastic matrix has a steady-state vector.

  2. If AA is a stochastic matrix, then any Markov chain defined by AA converges to a steady-state vector.

  3. If AA is a stochastic matrix, then λ=1\lambda=1 is an eigenvalue and all the other eigenvalues satisfy ∣λ∣<1|\lambda| \lt 1.

  4. A positive stochastic matrix has a unique steady-sta…

2.5

Exercise 4

Consider the stochastic matrix .

  1. Find the eigenvalues of AA.

  2. Do the conditions of the Perron-Frobenius theorem apply to this matrix?

  3. Find the steady-state vectors of AA.

  4. What can we guarantee about the long-term behavior of a Markov chain defined by the matrix AA?

2.5

Exercise 5

Explain your responses to the following.

  1. Why does Google use a Markov chain to compute the PageRank vector?

  2. Describe two problems that can happen when Google constructs a Markov chain using the Google matrix GG.

  3. Describe how these problems are consistent with the Perron-Frobenius theorem.

  4. Describe why the Perron-Frobenius theorem suggests creating a Markov chain using the modified Google matrix G′=αG+(1−α)HnG' = \alpha G + (1-\alpha)H_n.

2.5

Exercise 6

Suppose that AA is a stochastic matrix and that x\xvec is a probability vector. We would like to explain why the product AxA\xvec is a probability vector.

  1. Explain why x=[0.40.50.1]\xvec=\threevec{0.4}{0.5}{0.1} is a probability vector and then find the product SxS\xvec.

  2. More generally, if x\xvec is any probability vector, what is the product SxS\xvec?

  3. If AA is a stochastic matrix, explain why SA=SSA=S.

  4. Explain why AxA\xvec is a probability vector by considering the product SAxSA\xvec.

2.5

Exercise 7

Using the results of the previous exercise, we would like to explain why A2A^2 is a stochastic matrix if AA is stochastic.

  1. Suppose that AA and BB are stochastic matrices. Explain why the product ABAB is a stochastic matrix by considering the product SABSAB.

  2. Explain why A2A^2 is a stochastic matrix.

  3. How do the steady-state vectors of A2A^2 compare to the steady-state vectors of AA?

2.5

Exercise 8

This exercise explains why λ=1\lambda=1 is an eigenvalue of a stochastic matrix AA. To conclude that λ=1\lambda=1 is an eigenvalue, we need to know that A−IA-I is not invertible.

  1. What is the product S(A−I)S(A-I)?

  2. What is the product Se1S\evec_1?

  3. Consider the equation (A−I)x=e1(A-I)\xvec = \evec_1. Explain why this equation cannot be consistent by multiplying by SS to obtain S(A−I)x=Se1S(A-I)\xvec = S\evec_1.

  4. What can you say about the span of the columns of A−IA-I?

  5. Explain why we can conclude that A−IA-I is not invertib…

2.5

Adapted from Understanding Linear Algebra © 2023 David Austin. Licensed under CC BY 4.0. Source: Understanding Linear Algebra. Imported at revision 3e6dced.