neo4j: Extracting a subgraph as an adjacency matrix and calculating eigenvector centrality with JBLAS by Mark Needham.
Mark continues his exploration of Eigenvector centrality by adding Eigenvector centrality values back to the graph from which it was developed.
Putting the Eigenvector centrality measure results back into Neo4j make they easier to query.
What troubles me is that Eigenvector centrality values are based only upon the recorded information we have for the graph.
There is no allowance for missing relationships or any validation of the Eigenvector centrality values found.
Recalling Paul Revere was a “terrorist” in his day, the NSA uses algorithms to declare nodes “important,” lack of access to courts for detainees, and Eigenvector centrality values start to look dangerous.
How would you validate Eigenvector centrality values? Not mathematically but against known values or facts outside of your graph.