A Parameterized Centrality Metric for Network Analysis

A variety of metrics have been proposed to measure the relative importance of nodes in a network. One of these, alpha-centrality [P. Bonacich, Am. J. Sociol. 92, 1170 (1987)], measures the number of attenuated paths that exist between nodes. We introduce a normalized version of this metric and use it to study network structure, for example, to rank nodes and find community structure of the network. Specifically, we extend the modularity-maximization method for community detection to use this metric as the measure of node connectivity. Normalized alpha-centrality is a powerful tool for network analysis, since it contains a tunable parameter that sets the length scale of interactions. Studying how rankings and discovered communities change when this parameter is varied allows us to identify locally and globally important nodes and structures. We apply the proposed metric to several benchmark networks and show that it leads to better insights into network structure than alternative metrics.

[1]  Ulrik Brandes,et al.  Social Networks , 2013, Handbook of Graph Drawing and Visualization.

[2]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[3]  Fayez Gebali,et al.  Analysis of Computer and Communication Networks , 2008 .

[4]  P. Csermely.  Creative elements: network-based predictions of active centres in proteins and cellular and social networks. , 2008, Trends in biochemical sciences.

[5]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[6]  A. Arenas,et al.  Motif-based communities in complex networks , 2007, 0710.0059.

[7]  E A Leicht,et al.  Community structure in directed networks. , 2007, Physical review letters.

[8]  Sanjay Ghemawat,et al.  MapReduce: simplified data processing on large clusters , 2008, CACM.

[9]  R. Guimerà,et al.  Classes of complex networks defined by role-to-role connectivity profiles. , 2007, Nature physics.

[10]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Diederich Hinrichsen,et al.  Mathematical Systems Theory I , 2006, IEEE Transactions on Automatic Control.

[12]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

[13]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  M. Newman.  A measure of betweenness centrality based on random walks , 2003, Soc. Networks.

[15]  M. Newman,et al.  Identifying the role that animals play in their social networks , 2004, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[16]  S. Shen-Orr,et al.  Superfamilies of Evolved and Designed Networks , 2004, Science.

[17]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[18]  M. Newman.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  M. Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Haijun Zhou.  Network landscape from a Brownian particle's perspective. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Karl Rihaczek,et al.  1. WHAT IS DATA MINING? , 2019, Data Mining for the Social Sciences.

[22]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[23]  H. Rieger,et al.  Stability of shortest paths in complex networks with random edge weights. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[25]  Phillip Bonacich,et al.  Eigenvector-like measures of centrality for asymmetric relations , 2001, Soc. Networks.

[26]  Ian Witten,et al.  Data Mining , 2000 .

[27]  A. Châtelain,et al.  The European Physical Journal D , 1999 .

[28]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[29]  John F. Padgett,et al.  Robust Action and the Rise of the Medici, 1400-1434 , 1993, American Journal of Sociology.

[30]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

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

[32]  R. Fildes.  Journal of the American Statistical Association : William S. Cleveland, Marylyn E. McGill and Robert McGill, The shape parameter for a two variable graph 83 (1988) 289-300 , 1989 .

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

[34]  David L. Wallace,et al.  A Method for Comparing Two Hierarchical Clusterings: Comment , 1983 .

[35]  M. Tanner.  Trends in Biochemical Sciences , 1982 .

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

[37]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

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

[39]  Charles H. Hubbell.  An Input-Output Approach to Clique Identification , 1965 .

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

[41]  G. Simmel.  The sociology of Georg Simmel , 1950 .

[42]  P. Dienes.  NOTES ON LINEAR EQUATIONS IN INFINITE MATRICES , 1932 .

[43]  F. Boas,et al.  ANTHROPOLOGICAL RESEARCH. , 1919, Science.