Fast PageRank Computation via a Sparse Linear System

DOI10.1080/15427951.2005.10129108zbMath1095.68578OpenAlexW1967172740MaRDI QIDQ5474649

Antonio Guillí, Gianna M. Del Corso, Francesco Romani

Publication date: 26 June 2006

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2005.10129108

zbMATH Keywords

web ranking algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Network design and communication in computer systems (68M10)

Related Items (12)

Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors ⋮ On the Expressive Power of Query Languages for Matrices ⋮ Axiomatic characterization of PageRank ⋮ Techniques for analyzing dynamic random graph models of web-like networks: An overview ⋮ EXPLORING AND UNDERSTANDING CITATION-BASED SCIENTIFIC METRICS ⋮ PageRank computation with MAAOR and lumping methods ⋮ An Arnoldi-extrapolation algorithm for computing pagerank ⋮ PageRank Beyond the Web ⋮ Axioms for Centrality ⋮ Non-backtracking PageRank ⋮ Spectral rank monotonicity on undirected networks ⋮ Nonlocal pagerank

This page was built for publication: Fast PageRank Computation via a Sparse Linear System