A note on measures of similarity based on centrality

This note presents a measure of similarity between connected nodes in terms of centrality based on Euclidean distances, and compares it to ‘assortative mixing’ [Newman, M.E.J., 2002. Assortative mixing in networks. Physical Review Letters 89, 208701], which is based on Pearson correlation coefficient. This study suggests that the measure based on Euclidean distances may be more appropriate for relatively smaller (N < 500) and denser networks.