Local Computation of PageRank Contributions

DOI10.1007/978-3-540-77004-6_12MaRDI QIDQ5458308zbMATH OpenOpenAlexFDO

Authors Reid Andersen, John Hopcraft, Christian Borgs, Jennifer T. Chayes, Vahab S. Mirrokni, Shang-Hua Teng

Publication date 11 April 2008

Published in Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1259158596

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Local Computation of PageRank Contributions
• Nonlocal pagerank
• Strong localization in personalized PageRank vectors
• Local weak convergence for PageRank
• On Local Estimations of PageRank: A Mean Field Approach
• On Local Estimations of PageRank: A Mean Field Approach
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Fast distributed PageRank computation
• Using PageRank to Locally Partition a Graph

Cited in

(10)

• Local Computation of PageRank Contributions
• Locally-synchronous, iterative solver for Fourier-based homogenization
• Multiscale matrix sampling and sublinear-time PageRank computation
• Using PageRank to Locally Partition a Graph
• Estimating PageRank on graph streams
• scientific article; zbMATH DE number 6476017 (Why is no real title available?)
• A sublinear time algorithm for PageRank computations
• Network essence: PageRank completion and centrality-conforming Markov chains
• Red light green light method for solving large Markov chains
• Sublinear Algorithms for Local Graph-Centrality Estimation

This page was built for publication: Local Computation of PageRank Contributions

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