A systematic evaluation of assumptions in centrality measures by empirical flow data

When considering complex systems, identifying the most important actors is often of relevance. When the system is modeled as a network, centrality measures are used which assign each node a value due to its position in the network. It is often disregarded that they implicitly assume a network process flowing through a network, and also make assumptions of how the network process flows through the network. A node is then central with respect to this network process (Borgatti in Soc Netw 27(1):55–71, 2005, https://doi.org/10.1016/j.socnet.2004.11.008 ). It has been shown that real-world processes often do not fulfill these assumptions (Bockholt and Zweig, in Complex networks and their applications VIII, Springer, Cham, 2019, https://doi.org/10.1007/978-3-030-36683-4_7 ). In this work, we systematically investigate the impact of the measures’ assumptions by using four datasets of real-world processes. In order to do so, we introduce several variants of the betweenness and closeness centrality which, for each assumption, use either the assumed process model or the behavior of the real-world process. The results are twofold: on the one hand, for all measure variants and almost all datasets, we find that, in general, the standard centrality measures are quite robust against deviations in their process model. On the other hand, we observe a large variation of ranking positions of single nodes, even among the nodes ranked high by the standard measures. This has implications for the interpretability of results of those centrality measures. Since a mismatch of the behaviour of the real network process and the assumed process model does even affect the highly-ranked nodes, resulting rankings need to be interpreted with care.

[1]  Ulrik Brandes,et al.  Re-conceptualizing centrality in social networks† , 2016, European Journal of Applied Mathematics.

[2]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[3]  D. Watts,et al.  An Experimental Study of Search in Global Social Networks , 2003, Science.

[4]  Katharina Anna Zweig,et al.  Network Analysis Literacy , 2016, Lecture Notes in Social Networks.

[5]  Attila Korösi,et al.  Routes Obey Hierarchy in Complex Networks , 2017, Scientific Reports.

[6]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[7]  M. Kendall A NEW MEASURE OF RANK CORRELATION , 1938 .

[8]  C. E. Veni Madhavan,et al.  Understanding Human Navigation Using Network Analysis , 2012, Top. Cogn. Sci..

[9]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[10]  L. Freeman Centrality in social networks conceptual clarification , 1978 .

[11]  P. Bonacich Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[12]  Shanjiang Zhu,et al.  Do People Use the Shortest Path? An Empirical Test of Wardrop’s First Principle , 2015, PloS one.

[13]  Ingo Scholtes,et al.  Higher-order aggregate networks in the analysis of temporal networks: path structures and centralities , 2015, The European Physical Journal B.

[14]  Noah E. Friedkin,et al.  Horizons of Observability and Limits of Informal Control in Organizations , 1983 .

[15]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[16]  Alex Bavelas A Mathematical Model for Group Structures , 1948 .

[17]  M. Zelen,et al.  Rethinking centrality: Methods and examples☆ , 1989 .

[18]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[19]  Gábor Rétvári,et al.  A dataset on human navigation strategies in foreign networked systems , 2018, Scientific data.

[20]  E. J. Manley,et al.  Shortest path or anchor-based route choice: a large-scale empirical analysis of minicab routing in London , 2015 .

[21]  Gábor Rétvári,et al.  The role of detours in individual human navigation patterns of complex networks , 2020, Scientific Reports.

[22]  Martin Rosvall,et al.  Memory in network flows and its effects on spreading dynamics and community detection , 2013, Nature Communications.

[23]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[24]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[25]  Jaana Kekäläinen,et al.  Cumulated gain-based evaluation of IR techniques , 2002, TOIS.

[26]  Fred J. Damerau,et al.  A technique for computer detection and correction of spelling errors , 1964, CACM.

[27]  J. Nieminen On the centrality in a graph. , 1974, Scandinavian journal of psychology.

[28]  Rami Puzis,et al.  Routing betweenness centrality , 2010, JACM.

[29]  Mark E. J. Newman A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[30]  P. Bonacich Factoring and weighting approaches to status scores and clique identification , 1972 .