Fast distributed PageRank computation

DOI10.1016/J.TCS.2014.04.003zbMath1303.68148OpenAlexW4206219939WikidataQ56815223 ScholiaQ56815223MaRDI QIDQ477098

Anisur Rahaman Molla, Eli Upfal, Gopal Pandurangan, Atish Das Sarma

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.003

zbMATH Keywords

Monte Carlo methodrandom walkdistributed algorithmPageRank

Mathematics Subject Classification ID

Distributed algorithms (68W15) Internet topics (68M11)

Related Items (8)

An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC ⋮ Efficient numerical methods to solve sparse linear equations with application to PageRank ⋮ Quantum walk and its application domains: a systematic review ⋮ Time-optimal construction of overlay networks ⋮ Distributed PageRank computation with improved round complexities ⋮ Local dependency in networks ⋮ Pagerank asymptotics on directed preferential attachment networks ⋮ A note on the PageRank of undirected graphs

Cites Work

• Estimating PageRank on graph streams
• Deeper Inside PageRank
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• Distributed Random Walks
• Probability and Computing
• A Survey on PageRank Computing

This page was built for publication: Fast distributed PageRank computation