Skip to Main content Skip to Navigation

PageRank of Scale Free Growing Networks

Abstract : PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of Web page visits by a random surfer and thus it reflects the popularity of a Web page. In the present work we find an analytical expression for the expected PageRank value in a scale free growing network model as a function of the age of the growing network and the age of a particular node. Then, we derive asymptotics that shows that PageRank follows closely a power law. The exponent of the theoretical power law matches very well the value found from measurements of the Web. Finally, we provide a mathematical insight for the choice of the damping factor in PageRank definition.
Document type :
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 7:18:52 PM
Last modification on : Thursday, September 24, 2020 - 10:22:03 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:23:13 PM


  • HAL Id : inria-00070168, version 1



Konstantin Avrachenkov, Dmitri Lebedev. PageRank of Scale Free Growing Networks. [Research Report] RR-5858, INRIA. 2006, pp.24. ⟨inria-00070168⟩



Record views


Files downloads