On computing PageRank via lumping the Google matrix

DOI10.1016/j.cam.2008.06.003zbMath1167.68367OpenAlexW2039746387MaRDI QIDQ1002214

Yi-Min Wei, Xinghua Shi, Yi-Qin 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

power methodPageRanklumpinggoogle matrixdangling nodeweakly nondangling node

Mathematics Subject Classification ID

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

Related Items (20)

Micro- and macromodels of social networks. I: Theory fundamentals ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ A new extrapolation method for PageRank computations ⋮ An adaptive reordered method for computing PageRank ⋮ Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank ⋮ FOM accelerated by an extrapolation method for solving PageRank problems ⋮ A variant of the Power-Arnoldi algorithm for computing PageRank ⋮ An adaptive Power-GArnoldi algorithm for computing PageRank ⋮ The extrapolation-accelerated multilevel aggregation method in PageRank computation ⋮ A two-step matrix splitting iteration for computing PageRank ⋮ PageRank computation with MAAOR and lumping methods ⋮ Dynamic models of informational control in social networks ⋮ An Arnoldi-extrapolation algorithm for computing pagerank ⋮ A note on the two-step matrix splitting iteration for computing PageRank ⋮ The PageRank model of minimal irreducible adjustment and its lumping method ⋮ On the multi-splitting iteration method for computing PageRank ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ A general multi-splitting iteration method for computing PageRank ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ A Hessenberg-type algorithm for computing PageRank problems

Uses Software

• IPSEN

Cites Work

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

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