Decomposition of the Google PageRank and Optimal Linking Strategy

Konstantin Avrachenkov, Nelly Litvak

Research output: Book/ReportReportOther research output

19 Downloads (Pure)

Abstract

We provide the analysis of the Google PageRank from the perspective of the Markov Chain Theory. First we study the Google PageRank for a Web that can be decomposed into several connected components which do not have any links to each other. We show that in order to determine the Google PageRank for a completely decomposable Web, it is sufficient to compute a subPageRank for each of the connected components separately. Then, we study incentives for the Web users to form connected components. In particular, we show that there exists an optimal linking strategy that benefits a user with links inside its Web community and in contrast inappropriate links penalize the Web users and their Web communities.
Original languageEnglish
Place of PublicationSophia Antipolis
PublisherINRIA
Number of pages28
Publication statusPublished - Jan 2004

Publication series

NameResearch Report / INRIA, ISSN 0249-6399
PublisherINRIA
No.5101
ISSN (Print)1874-4850

Keywords

  • Decomposition
  • Perturbed Markov Chains
  • Google
  • Optimal Linking
  • PageRank

Fingerprint Dive into the research topics of 'Decomposition of the Google PageRank and Optimal Linking Strategy'. Together they form a unique fingerprint.

Cite this