Problem description
The Ranking of Nodes in Networks
Article REF: AF1527 V1
Problem description
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?

1. Problem description

A page is considered important if other important pages link to it. The importance of a page is therefore determined by the importance of the other pages linking to it. If a personal web page is only referenced in the main page of a small laboratory, this will give it relatively little importance. If, on the other hand, a link to it is found from the French President's page, then it will acquire much greater importance. The definition of a page's importance is therefore implicit, and the line vector r T containing the PageRanks of all pages is the solution to a fixed-point problem, as we shall see.

Let deg(i) ≥ 0 be the output degree of page i, i.e. the total number of pages to which this page points. Let P = (p ij ) be the transition matrix between page i and page j, where...

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