Internet Mathematics

PageRank of Scale-Free Growing Networks

Konstantin Avrachenkov and Dmitri Lebedev

Full-text: Open access

Abstract

PageRank is one of the principle criteria according to which Google ranks webpages. PageRank can be interpreted as a frequency of webpage visits by a random surfer, and thus it reflects the popularity of a webpage. 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 show that PageRank follows closely a power law in the middle range of its values. The exponent of the theoretical power law matches very well the value found from measurements of the World Wide Web. Finally, we provide a mathematical insight for the choice of the damping factor in PageRank definition.

Article information

Source
Internet Math., Volume 3, Number 2 (2006), 207-232.

Dates
First available in Project Euclid: 7 March 2008

Permanent link to this document
https://projecteuclid.org/euclid.im/1204906139

Mathematical Reviews number (MathSciNet)
MR2321830

Zentralblatt MATH identifier
1122.68406

Citation

Avrachenkov, Konstantin; Lebedev, Dmitri. PageRank of Scale-Free Growing Networks. Internet Math. 3 (2006), no. 2, 207--232. https://projecteuclid.org/euclid.im/1204906139


Export citation