The PageRank Problem

Bachelor thesis (2010)

Authors

Contributors

M.B. Van Gijzen (mentor)
Department
Applied mathematics (EEMCS) (TU Delft)
Copyright: © 2010 Den Besten, M.
More Info
expand_more

Published Date

24-08-2010

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Applied mathematics

Abstract

The thesis is the result of a bachelor research project about Google's PageRank. An analysis of the hyperlink structure of the World Wide Web is made and a model for web surfing studied. Based on this model, some standard methods to compute the PageRank of web pages is investigated. Special attention is given to computing PageRanks by using linear systems. In this respect the IDR(s) method is applied to achieve an efficient computation. Several numerical experiments are performed in order to compare the efficiency of different methods in computing PageRanks.