This work is licensed under the Creative Commons Attribution 4.0 International License.
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.AndersonE.BaiZ.BischofC.BlackfordS.DemmelJ.DongarraJ.Du CrozJ.GreenbaumA.HammarlingS.McKenneyA.SorensenD.19993rd ed.Philadelphia, PASIAM10.1137/1.9780898719604Search in Google Scholar
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=downloadBatageljV.MrvarA.2003University of LjubljanaSlovenia, EUAvailable at: http://pajek.imfm.si/doku.php?id=downloadSearch in Google Scholar
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.BastianM.HeymannS.JacomyM.2009Gephi: an open source software for exploring and manipulating networksAvailable at: https://gephi.org10.1609/icwsm.v3i1.13937Search in Google Scholar
Becker, R.A., Chambers, J.M., Wilks, A.R., (1988). The New S Language. Pacific Grove, CA: Brooks/Cole.BeckerR.A.ChambersJ.M.WilksA.R.1988Pacific Grove, CABrooks/ColeSearch in Google Scholar
Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2, 113–120.BonacichP.1972Factoring and weighting approaches to status scores and clique identification211312010.1080/0022250X.1972.9989806Search in Google Scholar
Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92, 1170–1182.BonacichP.1987Power and centrality: A family of measures921170118210.1086/228631Search in Google Scholar
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.htmBorgattiS.P.EverettM.G.FreemanL.C.2002Analytic TechnologiesHarvard, MAAvailable at: http://www.analytictech.com/ucinet.htmSearch in Google Scholar
Borgatti, S.P. (2006). Identifying sets of key players in a network. Computational, Mathematical and Organizational Theory, 121, 21–34.BorgattiS.P.2006Identifying sets of key players in a network121213410.1109/KIMAS.2003.1245034Search in Google Scholar
Butts, C.T. (2007). sna: Tools for Social Network Analysis. Version 2.2. Irvine, CA. Available at: http://erzuli.ss.uci.edu/R.stuffButtsC.T.2007Irvine, CAAvailable at: http://erzuli.ss.uci.edu/R.stuffSearch in Google Scholar
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/oraCarleyK.RemingaJ.2004Center for Analysis of Social and Organizational Systems, Carnegie Mellon UniversityPittsburgh, PAAvailable at: http://www.casos.cs.cmu.edu/projects/ora10.21236/ADA460034Search in Google Scholar
Csardi, G., Nepusz, T. (2006). The igraph software package for complex network research. InterJournal, Cambridge, MA, 1695. Available at: http://igraph.sourceforge.net.CsardiG.NepuszT.2006InterJournalCambridge, MA1695. Available at: http://igraph.sourceforge.netSearch in Google Scholar
Doreian, P. (2001). Causality in social network analysis. Sociological Methods Research, 30(1), 81–114.DoreianP.2001Causality in social network analysis3018111410.1177/0049124101030001005Search in Google Scholar
Dangalchev C. (2006). Residual Closeness in Networks. Physica, 365:2, 556–564.DangalchevC.2006Residual Closeness in Networks365255656410.1016/j.physa.2005.12.020Search in Google Scholar
Freeman, L.C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40: 35–41.FreemanL.C.1977A set of measures of centrality based on betweenness40354110.2307/3033543Search in Google Scholar
Freeman L.C. (1979). Centrality in Social Networks: Conceptual clarification. Social Networks, 1: 215–239.FreemanL.C.1979Centrality in Social Networks: Conceptual clarification121523910.1016/0378-8733(78)90021-7Search in Google Scholar
Freeman, L.C. (1984). Turning a profit from mathematics: the case of social networks. Journal of Mathematical Sociology, 10: 343–360.FreemanL.C.1984Turning a profit from mathematics: the case of social networks1034336010.1080/0022250X.1984.9989975Search in Google Scholar
Freeman, L.C. (2004). The Development of Social Network Analysis: A Study in the Sociology of Science. North Charleston, SC: BookSurge.FreemanL.C.2004North Charleston, SCBookSurgeSearch in Google Scholar
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.FreemanL.C.2011The Development of Social Network Analysis: with an Emphasis on Recent EventsinScottJohnCarringtonPetereds.Thousand Oaks, CASage2639Search in Google Scholar
Kirk, R.E. (1995). Experimental Design: Procedures for the Behavioral Sciences. (3rd ed.) Pacific Grove, CA: Brooks/Cole.KirkR.E.19953rd ed.Pacific Grove, CABrooks/ColeSearch in Google Scholar
Kleinberg, J. 1999. “Authoritative Sources in a Hyperlinked Environment.” Journal of the ACM 46(5):604-32.KleinbergJ.1999“Authoritative Sources in a Hyperlinked Environment.”4656043210.1515/9781400841356.514Search in Google Scholar
Knoke, D., Yang, S. (2008). Social Network Analysis. (2nd ed.) Los Angeles, CA: Sage.KnokeD.YangS.20082nd ed.Los Angeles, CASage10.4135/9781412985864Search in Google Scholar
Nieminen, J. (1974). On centrality in a graph. Social Science Research, 2: 371–378.NieminenJ.1974On centrality in a graph237137810.1111/j.1467-9450.1974.tb00598.xSearch in Google Scholar
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/OpsahlT.2010March 20Closeness centrality in networks with disconnected componentsIn:Retrieved November 21, 2011, from http://toreopsahl.com/2010/03/20/closeness-centrality-in-networks-with-disconnected-components/Search in Google Scholar
Otte, E, Rousseau, R. (2002). Social network analysis: a powerful strategy, also for the information sciences. Journal of Information Science, 28, 441–453.OtteERousseauR.2002Social network analysis: a powerful strategy, also for the information sciences2844145310.1177/016555150202800601Search in Google Scholar
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.pdfRemingaJ.CarleyK.2003CASOS Working PapersRetrieved November 21, 2011, from http://www.casos.cs.cmu.edu/publications/papers/reminga_2003_ora.pdfSearch in Google Scholar
Sabidussi, G. (1966). The centrality index of a graph. Psychometrika, 31, 581–603.SabidussiG.1966The centrality index of a graph3158160310.1007/BF02289527Search in Google Scholar
Snowden, D. (2005). From atomism to networks in social systems. The Learning Organization, 12(6), 552–562.SnowdenD.2005From atomism to networks in social systems12655256210.1108/09696470510626757Search in Google Scholar
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.StokmanF.N.DoreianP.1997Evolution of social networks: Processes and principlesDoreianPatrickStokmanFrans N.eds.AmsterdamGordon and Breach Publishers233250Search in Google Scholar
Valente, T.W., Coronges, K., Lakon, C., Costenbader, E. (2008). How correlated are network centrality measures? Connections, 28(1), 16–26.ValenteT.W.CorongesK.LakonC.CostenbaderE.2008How correlated are network centrality measures?2811626Search in Google Scholar
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.pdfWeiW.PfefferJ.RemingaJ.CarleyK.2011Handling Weighted, Asymmetric, Self-Looped and Disconnected NetworksRetrieved November 21, 2011, from http://www.casos.cs.cmu.edu/publications/papers/CMU-ISR-11-113.pdf10.21236/ADA550859Search in Google Scholar
Wikipedia (2011). Eigenvector Centrality. In: Centrality. Retrieved November 21, 2011, from http://en.wikipedia.org/wiki/Betweenness#Eigenve ctor_centrality.Wikipedia2011Eigenvector CentralityIn:Retrieved November 21, 2011, from http://en.wikipedia.org/wiki/Betweenness#Eigenve ctor_centralitySearch in Google Scholar
Wilkinson, J.H. (1965). The Algebraic Eigenvalue Problem. New York, NY: Oxford University Press.WilkinsonJ.H.1965New York, NYOxford University PressSearch in Google Scholar