An Analytical Comparison of Social Network Measures
- 14 April 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 1 (1) , 35-45
Abstract
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.Keywords
This publication has 45 references indexed in Scilit:
- Network InterventionsScience, 2012
- Detecting Novel Associations in Large Data SetsScience, 2011
- Structural investigation of supply networks: A social network analysis approachJournal of Operations Management, 2010
- Network Analysis in the Social SciencesScience, 2009
- Identifying sets of key players in a social networkComputational and Mathematical Organization Theory, 2006
- Destabilization of covert networksComputational and Mathematical Organization Theory, 2006
- Network clustering coefficient without degree-correlation biasesPhysical Review E, 2005
- Scientific collaboration networks. II. Shortest paths, weighted networks, and centralityPhysical Review E, 2001
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- Power and Centrality: A Family of MeasuresAmerican Journal of Sociology, 1987