Distributed Randomized Algorithms for the PageRank Computation
Distributed Randomized Algorithms for the PageRank Computation
复制标题
DOI：
10.1109/tac.2010.2042984
复制
发表时间：
2010-09-01
影响因子：
6.8
通讯作者：
Tempo, Roberto
中科院分区：
文献类型：
--
作者：
Ishii, Hideaki;Tempo, Roberto
在Google的搜索引擎中，PageRank算法对搜索结果的排序起着至关重要的作用。该算法根据网页的链接结构量化每个网页的重要性。我们首先提供原始问题设置的概述。然后，我们提出了几个分布式随机方案的PageRank的计算，其中的页面可以本地更新其值通过通信连接到那些链接。本文的主要目的是表明，这些计划渐近收敛的均方意义上的真实PageRank值。文中还详细讨论了与多智能体一致性问题的密切关系。
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.