An Analytical Comparison of Social Network Measures

Network science spans many different fields of study, ranging from psychology to biology to the social sciences. A number of descriptive network measures have been identified for use within these fields; however, little research examines the relationships of these measures for possible statistical dependence. The research presented in this paper uses Spearman's rank correlation coefficient to examine the statistical dependence between pairs of 24 widely accepted social network measures. Confidence intervals are compared to determine whether computation times between measures in the same correlation group are significantly different. We use a three-factor, four-level, full-factorial experimental design to construct a test set of 64 unique network topologies. The three factors of interest are the network structural properties of size, cluster ability, and the scale-free parameter. A set of 320 networks are generated from a power law degree distribution using a random graph generation algorithm. Results indicate that there exists high correlation among 14 of the 24 tested network measures, many of which also exhibit statistically significant differences with respect to computation time. These findings are of interest to analysts seeking to identify measures that provide similar ranked outcomes and where computational efficiency is an important consideration.

[1]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

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

[3]  Marc Sageman,et al.  Understanding terror networks. , 2004, International journal of emergency mental health.

[4]  Ernesto Estrada,et al.  Communicability in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[7]  A. Vázquez,et al.  Network clustering coefficient without degree-correlation biases. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Ulrik Brandes,et al.  Centrality Measures Based on Current Flow , 2005, STACS.

[9]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[10]  Richard F. Deckro,et al.  SNA data difficulties with dark networks , 2013 .

[11]  A. Shimbel.  Structural parameters of communication networks , 1953 .

[12]  Richard F. Deckro,et al.  Determining Critical Members of Layered Operational Terrorist Networks , 2009 .

[13]  Kathleen M. Carley.  Destabilization of covert networks , 2006, Comput. Math. Organ. Theory.

[14]  H. Milward,et al.  Dark Networks as Problems , 2003 .

[15]  Peter R. Monge,et al.  Theories of Communication Networks , 2003 .

[16]  Richard F. Deckro,et al.  A random graph generation algorithm for the analysis of social networks , 2014 .

[17]  Daniel J. Brass,et al.  Network Analysis in the Social Sciences , 2009, Science.

[18]  Samuel J Mullins,et al.  Social network analysis and counter-terrorism: measures of centrality as an investigative tool , 2013 .

[19]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[20]  John Scott.  What is social network analysis , 2010 .

[21]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[22]  Richard F. Deckro,et al.  Using Social Network Analysis to Inform Stabilization Efforts , 2013 .

[23]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[24]  Herbert Hamers,et al.  One-Mode Projection Analysis and Design of Covert Affiliation Networks , 2010, Soc. Networks.

[25]  Stefan Richter,et al.  Centrality Indices , 2004, Network Analysis.

[26]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[27]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

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

[29]  Ulrik Brandes,et al.  Efficient generation of large random networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[31]  M. A. Beauchamp.  AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.

[32]  J. Hamill.  Analysis of Layered Social Networks , 2012 .

[33]  Marta C. González,et al.  Cycles and clustering in bipartite networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[35]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[36]  C. Spearman.  The proof and measurement of association between two things. , 2015, International journal of epidemiology.

[37]  Thomas Y. Choi,et al.  Structural investigation of supply networks: A social network analysis approach , 2011 .

[38]  Eugene Santos,et al.  Infusing Social Networks With Culture , 2014, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

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

[40]  Peter Sanders,et al.  Better Approximation of Betweenness Centrality , 2008, ALENEX.

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

[42]  Michael Mitzenmacher,et al.  Detecting Novel Associations in Large Data Sets , 2011, Science.

[43]  Philip S. Yu,et al.  Mining Diversity on Networks , 2010, DASFAA.

[44]  Ajay Mehra.  The Development of Social Network Analysis: A Study in the Sociology of Science , 2005 .

[45]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

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

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

[48]  T. Valente.  Network Interventions , 2012, Science.

[49]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[50]  John M. Roberts.  Simple methods for simulating sociomatrices with given marginal totals , 2000, Soc. Networks.

[51]  Albert-László Barabási,et al.  Scale-free networks , 2008, Scholarpedia.

[52]  Mark Newman,et al.  Networks: An Introduction , 2010 .