Distributed Randomized Algorithms for PageRank Computation: Recent Advances
Authors:
- 15 December 2018
- book chapter
- Published by Springer Nature
- p. 419-447
Abstract
No abstract availableKeywords
All Related Versions
This publication has 53 references indexed in Scilit:
- Totally asynchronous distributed estimation of eigenvector centrality in digraphs with application to the PageRank problem2016
- Convergence time analysis of quantized gossip consensus on digraphsAutomatica, 2012
- Quantized Consensus and Averaging on Gossip DigraphsIEEE Transactions on Automatic Control, 2011
- Optimal Byzantine-resilient convergence in uni-dimensional robot networksTheoretical Computer Science, 2010
- Gossip consensus algorithms via quantized communicationAutomatica, 2010
- Distributed Average Consensus With Dithered QuantizationIEEE Transactions on Signal Processing, 2008
- Monte Carlo Methods in PageRank Computation: When One Iteration is SufficientSIAM Journal on Numerical Analysis, 2007
- Randomized gossip algorithmsIEEE Transactions on Information Theory, 2006
- A survey of computational complexity results in systems and controlAutomatica, 2000
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998