Fast PageRank Computation via a Sparse Linear System

DOI10.1080/15427951.2005.10129108MaRDI QIDQ5474649zbMATH OpenOpenAlexFDO

Authors Gianna M. Del Corso, Antonio Guillí, 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

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

Recommendations

• Algorithms and Models for the Web-Graph
• On accelerating the PageRank computation
• Parallelizing the Computation of PageRank
• A Reordering for the PageRank Problem
• An improved approach to the PageRank problems

Cited in

(29)

• Adaptive methods for the computation of PageRank
• Fast computation of stationary joint probability distribution of sparse Markov chains
• An efficient elimination strategy for solving PageRank problems
• An improved approach to the PageRank problems
• PageRank computation with MAAOR and lumping methods
• Spectral rank monotonicity on undirected networks
• Non-backtracking PageRank
• The PageRank model of minimal irreducible adjustment and its lumping method
• Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
• PageRank beyond the web
• On accelerating the PageRank computation
• A note on the convergence of SOR for the pagerank problem
• On the expressive power of query languages for matrices
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• Techniques for analyzing dynamic random graph models of web-like networks: An overview
• Exploring and understanding citation-based scientific metrics
• Towards an FPGA solver for the PageRank eigenvector problem
• Practical acceleration for computing the HITS expertrank vectors
• Axioms for Centrality
• Nonlocal pagerank
• Efficient numerical methods to solve sparse linear equations with application to PageRank
• Algorithms and Models for the Web-Graph
• Parallelizing the Computation of PageRank
• A Reordering for the PageRank Problem
• Truncated and sparse power methods with partially updating for large and sparse higher-order PageRank problems
• Axiomatic characterization of PageRank
• Time-dependent personalized PageRank for temporal networks: discrete and continuous scales
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
• An Arnoldi-extrapolation algorithm for computing pagerank

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5474649)