Back to Markov chains and Google's PageRank algorithm

Exercise 8

Avg difficulty 2.5

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 invertible and that λ=1\lambda=1 is an eigenvalue of AA.

Austin, Understanding Linear Algebra, §4.5 Markov chains and Google's PageRank algorithm, Exercise 8

AI Tutor

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