The PageRank vector
The Ranking of Nodes in Networks
Article REF: AF1527 V1
The PageRank vector
The Ranking of Nodes in Networks

Authors : Claude Brezinski, Michela Redivo-Zaglia

Publication date: April 10, 2017 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

2. The PageRank vector

As we have seen, according to the Perron-Frobenius theorem, r c ≥ 0. We normalize this vector so that e T r c = 1; it is, therefore, a probability vector.

We will express r c in different ways: implicit, explicit and polynomial expressions of the PageRank vector.

Note that from the iterates of the power method, it is possible to obtain rational and polynomial approximations of the vector r c . These approximations are based on the corresponding exact expressions given below, simply by choosing smaller degrees. In particular, Padé-type approximations can be constructed. On these issues, the reader can consult...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?


Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact us