Back to Markov chains and Google's PageRank algorithm

Exercise 3

Avg difficulty 2.5

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-state vector.

  5. If AA is an invertible stochastic matrix, then so is A−1A^{-1}.

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

AI Tutor

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