On computing PageRank via lumping the Google matrix

DOI10.1016/J.CAM.2008.06.003MaRDI QIDQ1002214zbMATH OpenOpenAlexFDO

Authors Xinghua Shi, Yimin Wei, Yiqin Lin

Publication date 25 February 2009

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2008.06.003

zbMATH Keywords

dangling nodegoogle matrixlumpingPageRankpower methodweakly nondangling node

Mathematics Subject Classification ID

Acceleration of convergence in numerical analysis (65B99) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Network design and communication in computer systems (68M10) Searching and sorting (68P10)

Recommendations

• PageRank Computation, with Special Attention to Dangling Nodes
• Google pageranking problem: The model and the analysis
• The PageRank model of minimal irreducible adjustment and its lumping method
• PageRank computation with MAAOR and lumping methods
• An extrapolation iteration and its lumped type iteration for computing PageRank

Cites work

• A Power–Arnoldi algorithm for computing PageRank
• A Reordering for the PageRank Problem
• A Survey on PageRank Computing
• Adaptive methods for the computation of PageRank
• An Arnoldi-type algorithm for computing Page Rank
• Comments on "Jordan Canonical Form of the Google Matrix"
• Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
• Deeper Inside PageRank
• Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem
• Extrapolation methods for PageRank computations
• Google's PageRank and beyond. The science of search engine rankings
• Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
• PageRank Computation, with Special Attention to Dangling Nodes

Cited in

(24)

• PageRank computation with MAAOR and lumping methods
• A multi-power and multi-splitting inner-outer iteration for PageRank computation
• An extrapolation iteration and its lumped type iteration for computing PageRank
• A Hessenberg-type algorithm for computing PageRank problems
• A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
• Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank
• A variant of the Power-Arnoldi algorithm for computing PageRank
• An adaptive Power-GArnoldi algorithm for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• The PageRank model of minimal irreducible adjustment and its lumping method
• On the multi-splitting iteration method for computing PageRank
• Micro- and macromodels of social networks. I: Theory fundamentals
• A new extrapolation method for PageRank computations
• PageRank Computation, with Special Attention to Dangling Nodes
• An adaptive reordered method for computing PageRank
• The extrapolation-accelerated multilevel aggregation method in PageRank computation
• A two-step matrix splitting iteration for computing PageRank
• Dynamic models of informational control in social networks
• On computing HITS ExpertRank via lumping the hub matrix
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
• A note on the two-step matrix splitting iteration for computing PageRank
• FOM accelerated by an extrapolation method for solving PageRank problems
• Google pageranking problem: The model and the analysis
• An Arnoldi-extrapolation algorithm for computing pagerank

Describes a project that uses

Uses Software

• IPSEN

This page was built for publication: On computing PageRank via lumping the Google matrix

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