Skip to main content
Log in

A Faster Katz Status Score Algorithm

  • Published:
Computational & Mathematical Organization Theory Aims and scope Submit manuscript

Abstract

A new graph theoretical algorithm to calculate Katz status scores reduces computational complexity from time O(n 3) to O(n + m). Randomly-generated graphs as well as data from a large empiric study are used to test the performance of two commercial network analysis packages (GRADAP and UCINET V), compared to the performance achieved by the authors' algorithm, implemented in Visual Basic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Acton, F.S. (1990), Numerical Methods that Work. The Mathematical Association of America, Washington D.C., Vol.8, pp.211–217.

    Google Scholar 

  • Bonacich, P. (1972), “Factoring and Weighting Approaches to Status Scores and Clique Identification, ” Journal of Mathematical Sociology, 2, 113–120.

    Google Scholar 

  • Brandes, U. (2000), “Faster Evaluation of Shortest-Path Based Centrality Indices, ” Konstanzer Schriften in Mathematik und Informatik, 120.

  • Borgatti, S.P., M.G. Everett and L.C. Freeman (1999), Ucinet 5.0 Version 1.00 for Windows: Software for Social Network Analysis. Natick: Analytic Technologies.

    Google Scholar 

  • Forsythe, G.E., M.A. Malcolm and C.B. Moler (1967), Computer Solution of Linear Algebraic Systems. Prentice-Hall, Inc., Englewood Cliffs, NJ, ch. 17.

    Google Scholar 

  • Freeman, L.C. (1978), “Centrality in Social Networks: Conceptual Clarification, ” Social Networks, 1, 215–239.

    Google Scholar 

  • Friedkin, N.E. (1991), “Theoretical Foundations for Centrality Measures, ” American Journal of Sociology, 96(6), 1478–1504.

    Google Scholar 

  • Gershgorin, S.A. (1931), Bull Acad Sciences de l'URRS, Classe mathém., 7-e série, Leningrad, (p.749. Cited in Kreyzig I., (1972), Advanced Engineering Mathematics, 3rd ed.), Section 18.12, Theorem 1.Wiley, New York.

    Google Scholar 

  • Hoede, C. (1978), “A New Status Score a Social Network, ” Twente University Department of Applied Mathematics (Memorandum no. 243).

  • Inter-University Project Group of the Universities of Amsterdam, Groningen, Nijmegen, and Twente (1989), GRADAP, Graph Definition and Analysis Package. ProGamma, Groningen, The Netherlands.

    Google Scholar 

  • Katz, L. (1953), “A New Status Index Derived from Sociometric Analysis, ” Psychometrika, 18, 39–43.

    Google Scholar 

  • Kučera, L. (1990), Combinatorial Algorithms IOP, Bristol, UK, 91–128 (in English).

  • Leik, R.K. and B.F. Meeker (1975), Mathematical Sociology. Prentice-Hall, Englewood Cliffs, NJ, chapter 5.

    Google Scholar 

  • Microsoft Corporation (1995), Visual Basic 6.0 Professional Edition, http://www.microsoft.com/vbasic/.

  • Microsoft Corporation (1996), Microsoft Windows NT Workstation Version 4.0, document number 69396-0696.

  • Nash, J.C. (1990), Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation, 2nd ed. IOP, Bristol, UK, 97–101 and 119–141.

    Google Scholar 

  • Richards, W.D. and A.J. Seary (2000), “Eigen Analysis of Networks, ” Journal of Social Structure, 1(2), (http://www.heinz.cmu.edu/project/INSNA/joss/ean.html).

  • Rosenthal, N., R. Karant, M. Ethier and M. Fingrutd (1987), “Centrality Analysis for Historians, ” Historical Methods, 20(2), 53–62.

    Google Scholar 

  • Rothenberg, R.B., D.E. Woodhouse, J.J. Potterat, S.Q. Muth, W.W. Darrow, A.S. Klovdahl (1995), “Social Networks in Disease Transmission: The Colorado Springs Study, ” in R.H. Needle, S.G. Genser and R.T. Trotter II, (eds.) Social Networks, Drug Abuse and HIV Transmission, National Institute on Drug Abuse Research Monograph no. 151 (NIH Publication no. 95-3889), pp. 3–19.

  • Rothenberg, R.B., J.J. Potterat, D.E. Woodhouse, W.W. Darrow, S.Q. Muth, A.S. Klovdahl (1995), “Choosing a Centrality Measure: Epidemiologic Correlates in the Colorado Springs Study of Social Networks, ” Social Networks, 17, 273–297.

    Google Scholar 

  • Rothenberg, R.B., J.J. Potterat, D.E. Woodhouse, S.Q. Muth, W.W. Darrow, A.S. Klovdahl (1998), “Social Network Dynamics and HIV Transmission, ” AIDS, 12, 1529–1536.

    Google Scholar 

  • SAS Institute Inc. (1985), SAS/IML User's Guide for Personal Computers, Version 6 ed., Cary, NC.

  • Stephenson, K. and M. Zelen (1989), “Rethinking Centrality: Methods and Examples, ” Social Networks, 11, 1–37.

    Google Scholar 

  • Woodhouse, D.E., R.B. Rothenberg, J.J. Potterat, W.W. Darrow, S.Q. Muth, A.S. Klovdahl, H.P. Zimmerman, H.L. Rogers, T.S. Maldonado, J.B. Muth, J.U. Reynolds (1994), “Mapping a Social Network of Heterosexuals at High Risk of Human Immunodeficiency Virus Infection, ” AIDS, 8, 1331–1336.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Foster, K.C., Muth, S.Q., Potterat, J.J. et al. A Faster Katz Status Score Algorithm. Computational & Mathematical Organization Theory 7, 275–285 (2001). https://doi.org/10.1023/A:1013470632383

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013470632383

Navigation