Are We in Agreement? Benchmarking and Reliability Issues between Social Network Analytic Programs
By: Philip J. Murphy, Karen T. Cuenco and YuFei Wang
References
- Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D. (1999). LAPACK Users' Guide. (3rd ed.). Philadelphia, PA: SIAM.
- Batagelj, V., Mrvar, A. (2003). Pajek – Analysis and Visualization of Large Networks. University of Ljubljana, Slovenia, EU. Available at: http://pajek.imfm.si/doku.php?id=download
- Bastian, M., Heymann S., Jacomy, M. (2009). Gephi: an open source software for exploring and manipulating networks. International AAAI Conference on Weblogs and Social Media. Available at: https://gephi.org.
- Becker, R.A., Chambers, J.M., Wilks, A.R., (1988). The New S Language. Pacific Grove, CA: Brooks/Cole.
- Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2, 113–120.
- Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92, 1170–1182.
- Borgatti, S.P., Everett, M.G., Freeman, L.C. (2002). Ucinet for Windows: Software for Social Network Analysis. Analytic Technologies, Harvard, MA. Available at: http://www.analytictech.com/ucinet.htm
- Borgatti, S.P. (2006). Identifying sets of key players in a network. Computational, Mathematical and Organizational Theory, 121, 21–34.
- Butts, C.T. (2007). sna: Tools for Social Network Analysis. Version 2.2. Irvine, CA. Available at: http://erzuli.ss.uci.edu/R.stuff
- Carley, K., Reminga, J. (2004). ORA: Organization Risk Analyzer*. Center for Analysis of Social and Organizational Systems, Carnegie Mellon University. Pittsburgh, PA. Available at: http://www.casos.cs.cmu.edu/projects/ora
- Csardi, G., Nepusz, T. (2006). The igraph software package for complex network research. InterJournal, Cambridge, MA, 1695. Available at: http://igraph.sourceforge.net.
- Doreian, P. (2001). Causality in social network analysis. Sociological Methods Research, 30(1), 81–114.
- Dangalchev C. (2006). Residual Closeness in Networks. Physica, 365:2, 556–564.
- Freeman, L.C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40: 35–41.
- Freeman L.C. (1979). Centrality in Social Networks: Conceptual clarification. Social Networks, 1: 215–239.
- Freeman, L.C. (1984). Turning a profit from mathematics: the case of social networks. Journal of Mathematical Sociology, 10: 343–360.
- Freeman, L.C. (2004). The Development of Social Network Analysis: A Study in the Sociology of Science. North Charleston, SC: BookSurge.
- Freeman, L.C. (2011). The Development of Social Network Analysis: with an Emphasis on Recent Events, in Sage Handbook of Social Network Analysis. John Scott and Peter Carrington, eds. Thousand Oaks, CA: Sage, 26–39.
- Kirk, R.E. (1995). Experimental Design: Procedures for the Behavioral Sciences. (3rd ed.) Pacific Grove, CA: Brooks/Cole.
- Kleinberg, J. 1999. “Authoritative Sources in a Hyperlinked Environment.” Journal of the ACM 46(5):604-32.
- Knoke, D., Yang, S. (2008). Social Network Analysis. (2nd ed.) Los Angeles, CA: Sage.
- Nieminen, J. (1974). On centrality in a graph. Social Science Research, 2: 371–378.
- Opsahl, T. (2010, March 20). Closeness centrality in networks with disconnected components. In: Tore Opsahl. Retrieved November 21, 2011, from http://toreopsahl.com/2010/03/20/closeness-centrality-in-networks-with-disconnected-components/
- Otte, E, Rousseau, R. (2002). Social network analysis: a powerful strategy, also for the information sciences. Journal of Information Science, 28, 441–453.
- Reminga, J., Carley, K. (2003). Measures for ORA (Organization Risk Analyzer*). CASOS Working Papers. Retrieved November 21, 2011, from http://www.casos.cs.cmu.edu/publications/papers/reminga_2003_ora.pdf
- Sabidussi, G. (1966). The centrality index of a graph. Psychometrika, 31, 581–603.
- Smith, B.T., Boyle, J.M., Dongarra, J.J., Garbow, B.S., Ikebe, Y., Klema, V., Moler, C.B. (1976). Matrix Eigensystems Routines – EISPACK Guide. Springer-Verlag Lecture Notes in Computer Science, 6.
- Snowden, D. (2005). From atomism to networks in social systems. The Learning Organization, 12(6), 552–562.
- Stokman, F.N., Doreian, P. (1997). Evolution of social networks: Processes and principles, Patrick Doreian and Frans N. Stokman, eds. Evolution of Social Networks. Amsterdam: Gordon and Breach Publishers, 233–250.
- Valente, T.W., Coronges, K., Lakon, C., Costenbader, E. (2008). How correlated are network centrality measures? Connections, 28(1), 16–26.
- Wei, W., Pfeffer, J., Reminga, J., Carley, K. (2011). Handling Weighted, Asymmetric, Self-Looped and Disconnected Networks. CASOS Technical Report: CMU-ISR-11-113. Retrieved November 21, 2011, from http://www.casos.cs.cmu.edu/publications/papers/CMU-ISR-11-113.pdf
- Wikipedia (2011). Eigenvector Centrality. In: Centrality. Retrieved November 21, 2011, from http://en.wikipedia.org/wiki/Betweenness#Eigenve ctor_centrality.
- Wilkinson, J.H. (1965). The Algebraic Eigenvalue Problem. New York, NY: Oxford University Press.
DOI: https://doi.org/10.21307/connections-2017-002 | Journal eISSN: 2816-4245 | Journal ISSN: 0226-1766
Language: English
Page range: 23 - 44
Published on: Jun 4, 2018
Published by: International Network for Social Network Analysis (INSNA)
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2018 Philip J. Murphy, Karen T. Cuenco, YuFei Wang, published by International Network for Social Network Analysis (INSNA)
This work is licensed under the Creative Commons Attribution 4.0 License.