Figure - uploaded by Ivan Samoylenko
Content may be subject to copyright.
μ measure and Kendall rank correlation coefficient. 

μ measure (panels (a) – (e)) and KRC (panels (f) – (j)) (see ext for definition) for the centrality vectors corresponding to different roles vs. the number of top nodes selected. Five datasets (enron, stack-overflow, math-overflow, scopus-multilayer and movielens) are considered in our study, and are indicated on top of each pair of panels. The right panels contain moreover legends with the color code used for drawing the different curves. (For interpretation of the references to color in this figure legend, the reader is referred to the web version of this article.)

μ measure and Kendall rank correlation coefficient. μ measure (panels (a) – (e)) and KRC (panels (f) – (j)) (see ext for definition) for the centrality vectors corresponding to different roles vs. the number of top nodes selected. Five datasets (enron, stack-overflow, math-overflow, scopus-multilayer and movielens) are considered in our study, and are indicated on top of each pair of panels. The right panels contain moreover legends with the color code used for drawing the different curves. (For interpretation of the references to color in this figure legend, the reader is referred to the web version of this article.)

Source publication
Article
The identification of central nodes within networks constitutes a task of fundamental importance in various disciplines, and it is an extensively explored problem within the scientific community. Several scalar metrics have been proposed for classic networks with dyadic connections, and many of them have later been extended to networks with higher-...