  The importance of a node in a social network is identified through a set of
measures called centrality. Degree centrality, closeness centrality,
betweenness centrality and clustering coefficient are the most frequently used
metrics to compute the nodes centrality. Their computational complexity in some
cases makes unfeasible, when not practically impossible, their computations.
For this reason we focused on two alternative measures, WERW-Kpath and Game of
Thieves, which are at the same time highly descriptive and computationally
affordable. Our experiments show that a strong correlation exists between
WERW-Kpath and Game of Thieves and the classical centrality measures. This may
suggest the possibility of using them as useful and more economic replacements
of the classical centrality measures.
