Chapter 12: Page ranking
Daniela Calvetti, Erkki Somersalo · Society for Industrial and Applied Mathematics eBooks · 2020
In this chapter we address the problem related to query matching in a large library of documents, the most prominent application being document search on the internet. If the corpus in the query matching problem is vast, the number of documents retrieved is typically so large that the user will have no way to browse through all of them and select the relevant documents. This is especially true for internet searches, where the number of pages is in the trillions and growing. An important tool that has made certain search engines successful is an effective page ranking algorithm for sorting the retrieved pages in order of importance. In this chapter, we review one particular page ranking algorithm: PageRank.