A Sublinear Time Algorithm for PageRank Computations

DOI10.1007/978-3-642-30541-2_4zbMath1342.05181OpenAlexW1752265245MaRDI QIDQ2900584

Michael Brautbar, Christian Borgs, Shang-Hua Teng, Jennifer T. Chayes

Publication date: 23 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30541-2_4

zbMATH Keywords

local randomized algorithm

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Internet topics (68M11)

Related Items (6)

On Approximating the Stationary Distribution of Time-reversible Markov Chains ⋮ Computing heat kernel PageRank and a local clustering algorithm ⋮ Sublinear Algorithms for Local Graph-Centrality Estimation ⋮ On approximating the stationary distribution of time-reversible Markov chains ⋮ Ranking and Sparsifying a Connection Graph ⋮ Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank

This page was built for publication: A Sublinear Time Algorithm for PageRank Computations