Bidirectional PageRank Estimation: From Average-Case to Worst-Case

DOI10.1007/978-3-319-26784-5_13zbMath1342.05168arXiv1507.08705OpenAlexW1918700400MaRDI QIDQ3460747

Siddhartha Banerjee, Peter Lofgren, Ashish Goel

Publication date: 8 January 2016

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

Full work available at URL: https://arxiv.org/abs/1507.08705

zbMATH Keywords

personalized PageRankrandom-walk probabilities

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Random walks on graphs (05C81)

Related Items (4)

On Approximating the Stationary Distribution of Time-reversible Markov Chains ⋮ Sublinear Algorithms for Local Graph-Centrality Estimation ⋮ On approximating the stationary distribution of time-reversible Markov chains ⋮ A Dynamic Algorithm for Network Propagation

This page was built for publication: Bidirectional PageRank Estimation: From Average-Case to Worst-Case