Advertisement

Linear algebra and search engines

  • Jean-François ColletEmail author
Chapter
  • 1.3k Downloads
Part of the Universitext book series (UTX)

Summary

The first five sections of this chapter develop the machinery necessary to give a purely linear-algebraic proof of the convergence theorem for ergodic chains on finite spaces. It is probably fair to say that the key property of the matrices (apart from being stochastic matrices) is positivity; this is why in order to make the presentation self-contained, most classical results on the Perron–Frobenius theory are included. The last section deals with the by now classical PageRank algorithm, which is included here because it is traditional to present it in the language of linear algebra rather than that of Markov processes.

Keywords

Markov Matrices Strong Connectivity General Nonnegative Matrices Computing Page Rank Main Spectral Properties 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Laboratoire J.A. DieudonnéUniversité de Nice Sophia-AntipolisNice Cedex 02France

Personalised recommendations