[graph-tool] Pagerank centrality
nvioli at cs.umd.edu
Mon May 2 22:04:02 CEST 2011
Apologies if I'm missing something, but the Pagerank algorithm doesn't seem
to be normalizing to the number of nodes in the graph, as suggested by the
This can be easily seen even in the example in the documentation
nodes with no out-links should have page rank centrality of (d - 1) / N (the
Gamma-(v) set is empty, so the sum term is zero.) Therefore, in a 100-node
graph, as in the example, nodes with no out-links should have centrality of
(1 - 0.8) / 100 = 0.002, however, the lowest centrality of any node in the
graph is 0.2 (which happens six times), which leads me to believe that the
algorithm is not dividing by N, as in the definition.
Please let me know if I'm making a mistake, and thanks for your wonderful
View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Pagerank-centrality-tp2891205p2891205.html
Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.
More information about the graph-tool