title: Adaptive Methods for the Computation of PageRank
creator: Kamvar, Sepandar
creator: Haveliwala, Taher
creator: Golub, Gene
subject: Databases and the Web
description: We observe that the convergence patterns of pages in the PageRank algorithm have a nonuniform distribution.  Specifically, many pages converge to their true PageRank quickly, while relatively few pages take a much longer time to converge.  Furthermore, we observe that these slow-converging pages are generally those pages with high PageRank.  We use this observation to devise a simple algorithm to speed up the computation of PageRank, in which the PageRank of pages that have converged are not recomputed at each iteration after convergence.  This algorithm, which we call Adaptive PageRank, speeds up the computation of PageRank by nearly 30\%.
publisher: Stanford
date: 2003-04-28
type: Techreport
type: NonPeerReviewed
format: application/pdf
identifier: http://ilpubs.stanford.edu:8090/774/1/2003-26.pdf
identifier: Kamvar, Sepandar and Haveliwala, Taher and Golub, Gene (2003) Adaptive Methods for the Computation of PageRank. Technical Report. Stanford.
relation: http://ilpubs.stanford.edu:8090/774/