PageRank of Scale Free Growing Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

PageRank of Scale Free Growing Networks


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.
Fichier principal
Vignette du fichier
RR-5858.pdf (343.63 Ko) Télécharger le fichier

Dates and versions

inria-00070168 , version 1 (19-05-2006)


  • 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⟩
501 View
645 Download


Gmail Facebook X LinkedIn More