Distributed PageRank computation with improved round complexities

DOI10.1016/J.INS.2022.05.108MaRDI QIDQ6195176zbMATH OpenOpenAlexFDO

Authors Siqiang Luo, Xiaowei Wu, Ben Kao

Publication date 13 March 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2022.05.108

zbMATH Keywords

graphalgorithmsPageRankdistributed computation

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Recommendations

• Fast distributed PageRank computation
• Distributed randomized algorithms for PageRank computation: recent advances
• Distributed PageRank computation with link failures
• PageRank computation via a distributed randomized approach with lossy communication
• A sublinear time algorithm for PageRank computations

Cites work

• A Hessenberg-type algorithm for computing PageRank problems
• A variant of the Power-Arnoldi algorithm for computing PageRank
• An efficient elimination strategy for solving PageRank problems
• Constructive proofs of concentration bounds
• Distributed computation of large-scale graph problems
• Efficient distributed random walks with applications
• Estimating PageRank on graph streams
• Fast distributed PageRank computation
• Fast distributed random walks
• Lessons from the congested clique applied to MapReduce
• MST in \(O(1)\) rounds of congested clique
• MST in log-star rounds of congested clique
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• On the power of the congested clique model
• Optimal deterministic routing and sorting on the congested clique
• The diameter of a scale-free random graph
• Toward optimal bounds in the congested clique, graph connectivity and MST
• Walking randomly, massively, and efficiently

This page was built for publication: Distributed PageRank computation with improved round complexities

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