Decomposition of the Google pagerank and optimal linking strategy

Konstantin Avrachenkov, Nelly Litvak

Research output: Book/ReportReportProfessional

20 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 on the other hand inappropriate links penalize the Web users and their Web communities.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages13
Publication statusPublished - 2004

Publication series

NameMemorandum Faculty of Mathematical Sciences
PublisherUniversity of Twente, Department of Applied Mathematics
No.1712
ISSN (Print)0169-2690

    Fingerprint

Keywords

  • MSC-68U35
  • MSC-60J20
  • MSC-60J22

Cite this

Avrachenkov, K., & Litvak, N. (2004). Decomposition of the Google pagerank and optimal linking strategy. (Memorandum Faculty of Mathematical Sciences; No. 1712). Enschede: University of Twente, Department of Applied Mathematics.