The PageRank Problem

Title

The PageRank Problem

 Author

Den Besten, M.

Contributor

Van Gijzen, M.B. (mentor)

Faculty

Electrical Engineering, Mathematics and Computer Science

 Department

Applied mathematics

 Date

2010-08-24

 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.

 Subject

Google
PageRank
IDR(s)
Power method
Jacobi iteration
Gauss-Seidel iteration
Markov chain

 To reference this document use:

http://resolver.tudelft.nl/uuid:0483fd00-117d-43a3-b61f-6ce8a178e709

 Embargo date

2016-04-01

 Part of collection

Student theses

 Document type

bachelor thesis

 Rights

(c) 2010 Den Besten, M.
Files
PDF Bachelor_thesis_TW_Rien_d ... Besten.pdf 2.69 MB
Close viewer