pith. sign in

arxiv: 0704.2694 · v1 · submitted 2007-04-20 · 🧮 math.PR

Determining factors behind the PageRank log-log plot

classification 🧮 math.PR
keywords pagerankin-degreepowerdanglingexponentfractionlawsnodes
0
0 comments X
read the original abstract

We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relation through a stochastic equation inspired by the original definition of PageRank. Further, we use the theory of regular variation to prove that PageRank and in-degree follow power laws with the same exponent. The difference between these two power laws is in a multiple coefficient, which depends mainly on the fraction of dangling nodes, average in-degree, the power law exponent, and damping factor. The out-degree distribution has a minor effect, which we explicitly quantify. Our theoretical predictions show a good agreement with experimental data on three different samples of the Web.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.