Distributed Randomized Algorithms for PageRank Computation : An Approach based on Cooperative Control

在这个研究项目中，我们专注于搜索引擎的PageRank算法，这是已知的是有效的排名搜索结果，并已开发出有效的计算方法。从多智能体协同控制的角度出发，设计了基于随机化的分布式算法。我们的成就包括更强大和快速的算法下的代理之间的通信约束，也是那些基于一种新的技术的图聚合。另一方面，我们得到了一般有向图上平均一致性问题的有效算法。

In this research project, we have focused on the PageRank algorithm for search engines, which is known to be effective in ranking search results and have developed efficient computation methods. From the viewpoint of multi-agent cooperative control, we have designed distributed algorithms based on randomization. Our achievements include more robust and fast algorithms under communication constraints among the agents and also those based on a novel technique of graph aggregation. On the other hand, we obtained useful algorithms for average consensus problems on general directed graphs.