.png){kind=icon}
Return
Distributed Randomized Algorithms for the PageRank Computation
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2010.2042984.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the search engine of Google, the PageRank algorithm plays a crucial role in ranking the search results. The algorithm quantifies the importance of each web page based on the link structure of the web. We first provide an overview of the original problem setup. Then, we propose several distributed randomized schemes for the computation of the PageRank, where the pages can locally update their values by communicating to those connected by links. The main objective of the paper is to show that these schemes asymptotically converge in the mean-square sense to the true PageRank values. A detailed discussion on the close relations to the multi-agent consensus problems is also given.
Keywords:
Distributed computation
multi-agent consensus
PageRank algorithm
randomization
search engines
stochastic matrices
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
ShareSaveSensor nodes estimation for a greenhouse monitoring system using hierarchical wireless network.png)
2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)
2017 25th International Conference on Software, Telecommunications and Computer Networks (SoftCOM)IF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more