Distributed Randomized Algorithms for the PageRank Computation

Details Distributed Randomized Algorithms for the PageRank Computation Distributed Randomized Algorithms for the PageRank Computation

2012-03-29

arxiv.org/abs/1203.6599v1

IEEE Transactions on Automatic Control, 55: 1987-2002, 2010

Computer Science

Systems and Control

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distributed Randomized Algorithms for the PageRank Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Randomized Algorithms for the PageRank Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Randomized Algorithms for the PageRank Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-58326