A distributed randomized approach for the PageRank computation: Part 1

Author

Ishii, Hideaki ; Tempo, Roberto

Author_Institution

Dept. of Comput. Intell. & Syst. Sci., Tokyo Inst. of Technol., Yokohama, Japan

fYear

2008

fDate

9-11 Dec. 2008

Firstpage

3523

Lastpage

3528

Abstract

In the search engine of Google, the PageRank algorithm plays a crucial role in ranking the obtained results. The algorithm quantifies the importance of each Web page based on the link structure of the Web. In this two-part paper, 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. A detailed discussion on the close relations to the multi-agent consensus problems is also given.

Keywords

Internet; matrix algebra; search engines; stochastic processes; Google; PageRank computation; Web page; distributed randomized approach; link structure; multiagent consensus problems; search engine; stochastic matrices; Computational intelligence; Control systems; Crawlers; Distributed computing; Educational technology; Eigenvalues and eigenfunctions; Search engines; Stochastic processes; Voting; Web pages; Distributed computation; Multi-agent consensus; PageRank algorithm; Randomization; Stochastic matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2008. CDC 2008. 47th IEEE Conference on

Conference_Location

Cancun

ISSN

0191-2216

Print_ISBN

978-1-4244-3123-6

Electronic_ISBN

0191-2216

Type

conf

DOI

10.1109/CDC.2008.4739020

Filename

4739020