Eigenvector Centrality (Beta)
Eigenvector centrality (also called eigencentrality or prestige score) is a measure of the influence of a vertex in a network. Relative scores are assigned to all vertices in the network based on the concept that connections to high-scoring vertices contribute more to the score of the vertex in question than equal connections to low-scoring vertices. A high eigenvector score means that a vertex is connected to many vertices who themselves have high scores.
For more information, see Eigenvector centrality.
Specification
Parameters
Name | Description | Data type |
| Vertex types to assign scores to. |
|
| Edge types to traverse. |
|
| Maximum number of iteration. |
|
| The convergence limit. |
|
| The number of vertices with the highest scores to return. |
|
| If true, print results to JSON output. |
|
| If not empty, save the score of each vertex to this attribute. |
|
| If not empty, print results in CSV to this file. |
|
Return value
The vertices with the highest Eigenvector centrality scores along with their score.
Example
Suppose we have the following graph:
Running the algorithm on the graph will show that Dan has the highest centrality score.
Last updated