Fast distributed PageRank computation

DOI10.1016/J.TCS.2014.04.003MaRDI QIDQ477098zbMATH OpenOpenAlexWikidataFDO

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

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

random walkMonte Carlo methoddistributed algorithmPageRank

Mathematics Subject Classification ID

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

Recommendations

• Distributed PageRank computation with link failures
• PageRank computation via a distributed randomized approach with lossy communication
• Fast distributed random walks
• Estimating PageRank on graph streams
• A sublinear time algorithm for PageRank computations

Cites work

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

Cited in

(20)

• Local Computation of PageRank Contributions
• Multiscale matrix sampling and sublinear-time PageRank computation
• Pagerank asymptotics on directed preferential attachment networks
• A note on the PageRank of undirected graphs
• Quantum walk and its application domains: a systematic review
• An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
• Distributed algorithms for finding local clusters using heat kernel PageRank
• Distributed PageRank computation with link failures
• Distributed PageRank computation with improved round complexities
• PageRank computation via a distributed randomized approach with lossy communication
• Multicommodity allocation for dynamic demands using PageRank vectors
• Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
• Efficient numerical methods to solve sparse linear equations with application to PageRank
• A parallel pagerank algorithm for undirected graph
• Local Computation of PageRank Contributions
• Estimating PageRank on graph streams
• Distributed computation of large-scale graph problems
• Graph fibrations, graph isomorphism, and PageRank
• Multi-commodity allocation for dynamic demands using PageRank vectors
• Local dependency in networks

This page was built for publication: Fast distributed PageRank computation

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