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

点击翻译按钮获取中文摘要

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.