Article | REF: AF1527 V1

The Ranking of Nodes in Networks

Authors: Claude Brezinski, Michela Redivo-Zaglia

Publication date: April 10, 2017

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

Already subscribed? Log in!


Français

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.

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? Log in!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Mathematics

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
The PageRank vector