HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Decomposition of the Google PageRank and Optimal Linking Strategy

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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 5:42:53 PM
Last modification on : Thursday, January 20, 2022 - 5:27:36 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:18:18 PM


  • HAL Id : inria-00071482, version 1



Konstantin Avrachenkov, Nelly Litvak. Decomposition of the Google PageRank and Optimal Linking Strategy. [Research Report] RR-5101, INRIA. 2004. ⟨inria-00071482⟩



Record views


Files downloads