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