PageRank

From Gephi:Wiki

PageRank This metric is implemented in 0.7 and 0.8. Network metric

short description of the metric

Objective

The Objective should define how the metric can be used, for which purpose etc. 

Description

An iterative algorithm that measures the importance of each node within the network. The metric assigns each node a probability that is the probability of being at that page after many clicks. The page rank values are the values in the eigenvector that has the highest corresponding eigenvalue of a normalized adjacency matrix A'. The standard adjacency matrix is normalized so that the columns of the matrix sum to 1.

Reference

Page, Lawrence; Brin, Sergey; Motwani, Rajeev and Winograd, Terry (1999). The PageRank citation ranking: Bringing order to the Web. PDF

Source code

See org.gephi.statistics.plugin.PageRank.java.

Acknowledgements

This code was implemented by Patrick McSweeney.

Implemented Algorithm

Additional Reading

• Sergey Brin, Lawrence Page, The Anatomy of a Large-Scale Hypertextual Web Search Engine, in Proceedings of the seventh International Conference on the World Wide Web (WWW1998):107-117
• NWB wiki
• Wikipedia