Computing PageRank using Power Extrapolation

Abstract

Method by subtracting off the error along several nonprincipal eigenvectors from the current iterate of the Power Method, making use of known nonprincipal eigenvalues of the Web hyperlink matrix. Empirically, we show that using Power Extrapolation speeds up PageRank computation by 30% on a Web graph of 80 million nodes in realistic scenarios over the standard power method, in a way that is simple to understand and implement.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2010-12-22

Downloads
14 (#997,421)

6 months
6 (#531,961)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Daniel Klein
Harvard University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references