Eigenvector centrality is implemented in GDS. You can compute it on your favorite projected graph using the following code:
CALL gds.alpha.eigenvector.stream("projected_graph", {}) YIELD nodeId, score as score
RETURN gds.util.asNode(nodeId).name as nodeName, score
ORDER BY score DESC
This closes a long section about the PageRank algorithm and its variants. However, as we discussed earlier, node importance is not necessarily related to popularity. In the next section, we are going to talk about other centrality algorithms, such as betweenness centrality, which can be used to identify the critical nodes in a network.
