Table 4.
Experimental time complexities of 18 node centrality metrics on 3 network types.
| Metric | Network type | ||
|---|---|---|---|
| Scale-free | Small-world | Random | |
| Subgraph | O(n2) | O(n2) | O(n2log(n)) |
| Geodesic K-Path | O(n2log(n)) | O(n2) | O(n2log(n)) |
| MNC | O(nlog(n)) | O(n2) | O(nlog(n)) |
| DMNC | O(nlog(n)) | O(n2) | O(nlog(n)) |
| Decay | O(n2log(n)) | O(n2log(n)) | O(n2log(n)) |
| Topological | O(n2log(n)) | O(nlog(n)) | O(n) |
| Lobby index | O(nlog(n)) | O(n2) | O(n2) |
| Coreness | O(nlog(n)) | O(n2) | O(n3) |
| Leverage | O(nlog(n)) | O(nlog(n)) | O(nlog(n)) |
| Group | O(nlog(n)) | O(nlog(n)) | O(nlog(n)) |
| Wiener Index | O(n2) | O(n2log(n)) | O(n2log(n)) |
| K-Path | O(nlog(n)) | O(nlog(n)) | O(nlog(n)) |
| Diffusion degree | O(nlog(n)) | O(n2) | O(nlog(n)) |
| LeaderRank | O(n2) | O(n2) | O(n3) |
| Laplacian | O(nlog(n)) | O(n2) | O(nlog(n)) |
| Local bridging | O(nlog(n)) | O(nlog(n)) | O(nlog(n)) |
| VoteRank | O(n2) | O(n3) | O(n2log(n)) |
| HeatMap | O(n2log(n)) | O(n2log(n)) | O(n2log(n)) |
Situations with good scaling behaviors are shown in while those with a quickly rising cost are shown in .