Local Computation of PageRank Contributions

DOI10.1080/15427951.2008.10129302zbMATH Open1206.68346OpenAlexW3030647867MaRDI QIDQ3078596FDOQ3078596

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

Publication date: 28 February 2011

Published in: Internet Mathematics (Search for Journal in Brave)

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Internet topics (68M11)

Cited In (10)

• Multiscale matrix sampling and sublinear-time PageRank computation
• Using PageRank to Locally Partition a Graph
• Sublinear Algorithms for Local Graph-Centrality Estimation
• Title not available (Why is that?)
• Title not available (Why is that?)
• A sublinear time algorithm for PageRank computations
• Local Computation of PageRank Contributions
• Can we locally compute sparse connected subgraphs?
• Local algorithms for sparse spanning graphs
• Constructing near spanning trees with few local inspections

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 Q3078596)