Understanding node relationships and graph characteristics |
1. Distribution of nodes by degree | Yes | Yes | No | No | Nof | Nof |
2. Quickly determine the number of high-degree nodes | Yes | Yes | No | No | Yes | Nof |
3. Quickly identify which are the highest degree nodes | Yes | Yesa | Nob | No | Yes | Yes |
4. Determine if the highest degree nodes are directly connected to other high-degree nodes | Yes | No | Yesc | Nob | Yes | Yes |
5. Determine whether the highest degree nodes are connected to each other indirectly via two hops | Yes | No | Yes | Yesc | Yes | Yes |
6. Determine which lower-degree nodes are directly connected to the high-degree nodes | Yes | No | Yes | Yes | Yes | Yes |
7. Provide visual cue of how much difference exists between the degree of the nodes, especially high-degree nodes | Yes | Yes | No | No | No | Yes |
8. Determine if there is one central cluster or many clusters that contain the highest degree nodes | Yes | No | Yes | Yes | No | Yes |
Representing large or directed networks, or with weighted links |
9. Provide log–log or semi–log representation for very large data sets | Yes | Yes | No | No | No | No |
10. Can visualize both directed and undirected graphs | Yes | No | Yese | Yese | Yes | Yes |
11. Determine which nodes connect to the highest weighted links | Yes | No | Yesd | Yes | Yesg | Yesg |
Other centrality measures, standard format, low calculation cost |
12. Distribution of nodes by other centrality measures | Yes | Yes | No | No | No | No |
13. Provide a canonical representation of the graph | Yes | Yes | No | No | Yes | No |
14. Low calculation cost | Yes | Yes | No | No | Yes | Noh |