On computing PageRank via lumping the Google matrix
type: Item
instance of: scholarly article
title: On computing PageRank via lumping the Google matrix
zbMATH Open document ID: 1167.68367
author: Xinghua Shi
author: Yimin Wei
author: Yiqin Lin
published in: Journal of Computational and Applied Mathematics
publication date: 2009-02-25T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 65B99
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5518733
zbMATH Keywords: PageRank
zbMATH Keywords: dangling node
zbMATH Keywords: weakly nondangling node
zbMATH Keywords: power method
zbMATH Keywords: google matrix
zbMATH Keywords: lumping
describes a project that uses: IPSEN
MaRDI profile type: Publication
full work available at URL: j.cam.2008.06.003
OpenAlex ID: W2039746387
cites work: A Survey on PageRank Computing
cites work: Extrapolation methods for PageRank computations
cites work: An Arnoldi-type algorithm for computing Page Rank
cites work: PageRank Computation, with Special Attention to Dangling Nodes
cites work: Convergence Analysis of a PageRank Updating Algorithm by Langville and Meyer
cites work: Adaptive methods for the computation of PageRank
cites work: A Reordering for the PageRank Problem
cites work: Deeper Inside PageRank
cites work: Q5491464
cites work: Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
cites work: A Power–Arnoldi algorithm for computing PageRank
cites work: Comments on "Jordan Canonical Form of the Google Matrix"
cites work: Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem
DOI: 10.1016/J.CAM.2008.06.003
description: scientific article; zbMATH DE number 5518733