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

6. Conclusions

Here we've presented the problem of ranking Web pages in order of importance. This ranking is based on the PageRank algorithm developed by the creators of Google. We reviewed the fundamental ideas behind this algorithm, discussed the power method for its implementation and highlighted its difficulties. We then showed how to accelerate convergence and extrapolate the resulting vectors. It's important to understand, however, that this algorithm is only one of those used in search engines. We don't even know if it's still in use today, as this field is covered by industrial secrecy. The question has, however, been widely studied by the numerical linear algebra community. Indeed, the same type of problem is encountered in other areas of applied mathematics. In any case, it's a great example to illustrate numerical analysis courses on calculating the eigenelements of a matrix!

...

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