IDEAS home Printed from https://ideas.repec.org/a/spr/comaot/v7y2001i4d10.1023_a1013470632383.html
   My bibliography  Save this article

A Faster Katz Status Score Algorithm

Author

Listed:
  • Kurt C. Foster

    (Private Consultants)

  • Stephen Q. Muth

    (Private Consultants)

  • John J. Potterat

    (El Paso County Department of Health)

  • Richard B. Rothenberg

    (Emory University School of Medicine)

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.

Suggested Citation

  • Kurt C. Foster & Stephen Q. Muth & John J. Potterat & Richard B. Rothenberg, 2001. "A Faster Katz Status Score Algorithm," Computational and Mathematical Organization Theory, Springer, vol. 7(4), pages 275-285, December.
  • Handle: RePEc:spr:comaot:v:7:y:2001:i:4:d:10.1023_a:1013470632383
    DOI: 10.1023/A:1013470632383
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1013470632383
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1013470632383?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wahid-Ul-Ashraf, Akanda & Budka, Marcin & Musial, Katarzyna, 2019. "How to predict social relationships — Physics-inspired approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1110-1129.
    2. Vicenç Quera & Francesc S. Beltran & Ruth Dolado, 2010. "Flocking Behaviour: Agent-Based Simulation and Hierarchical Leadership," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 13(2), pages 1-8.
    3. Zhou, Wen & Jia, Yifan, 2017. "Predicting links based on knowledge dissemination in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 561-568.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Xiaodong & Patacchini, Eleonora & Zenou, Yves & Lee, Lung-Fei, 2011. "Criminal Networks: Who is the Key Player?," Research Papers in Economics 2011:7, Stockholm University, Department of Economics.
    2. Gabrielle Demange, 2018. "Contagion in Financial Networks: A Threat Index," Management Science, INFORMS, vol. 64(2), pages 955-970, February.
    3. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    4. Zhepeng Li & Xiao Fang & Xue Bai & Olivia R. Liu Sheng, 2017. "Utility-Based Link Recommendation for Online Social Networks," Management Science, INFORMS, vol. 63(6), pages 1938-1952, June.
    5. Dequiedt, Vianney & Zenou, Yves, 2017. "Local and consistent centrality measures in parameterized networks," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 28-36.
    6. Luca Colombo & Paola Labrecciosa & Agnieszka Rusinowska, 2025. "A dynamic analysis of criminal networks," Post-Print hal-04850675, HAL.
    7. ,, 2014. "A ranking method based on handicaps," Theoretical Economics, Econometric Society, vol. 9(3), September.
    8. Ernest Liu & Aleh Tsyvinski, 2021. "Dynamical Structure and Spectral Properties of Input-Output Networks," Working Papers 2021-13, Princeton University. Economics Department..
    9. Bouveret, Géraldine & Mandel, Antoine, 2021. "Social interactions and the prophylaxis of SI epidemics on networks," Journal of Mathematical Economics, Elsevier, vol. 93(C).
    10. Noah E. Friedkin & Karen S. Cook, 1990. "Peer Group Influence," Sociological Methods & Research, , vol. 19(1), pages 122-143, August.
    11. Verdier, Thierry & Zenou, Yves, 2017. "The role of social networks in cultural assimilation," Journal of Urban Economics, Elsevier, vol. 97(C), pages 15-39.
    12. Elosegui, Pedro & Forte, Federico D. & Montes-Rojas, Gabriel, 2022. "Network structure and fragmentation of the Argentinean interbank markets," Latin American Journal of Central Banking (previously Monetaria), Elsevier, vol. 3(3).
    13. Karpf, Andreas & Mandel, Antoine & Battiston, Stefano, 2018. "Price and network dynamics in the European carbon market," Journal of Economic Behavior & Organization, Elsevier, vol. 153(C), pages 103-122.
    14. V. Kumar & Vikram Bhaskaran & Rohan Mirchandani & Milap Shah, 2013. "Practice Prize Winner ---Creating a Measurable Social Media Marketing Strategy: Increasing the Value and ROI of Intangibles and Tangibles for Hokey Pokey," Marketing Science, INFORMS, vol. 32(2), pages 194-212, March.
    15. Harkins, Andrew, 2020. "Network Comparative Statics," The Warwick Economics Research Paper Series (TWERPS) 1306, University of Warwick, Department of Economics.
    16. Judit Bar-Ilan & Mark Levene, 2015. "The hw-rank: an h-index variant for ranking web pages," Scientometrics, Springer;Akadémiai Kiadó, vol. 102(3), pages 2247-2253, March.
    17. Costantini, Mauro & Maaitah, Ahmad & Mishra, Tapas & Sousa, Ricardo M., 2023. "Bitcoin market networks and cyberattacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).
    18. Áureo de Paula, 2015. "Econometrics of network models," CeMMAP working papers CWP52/15, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    19. Balázs Sziklai, 2018. "How to identify experts in a community?," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 155-173, March.
    20. Viswanath Venkatesh & Tracy Ann Sykes, 2013. "Digital Divide Initiative Success in Developing Countries: A Longitudinal Field Study in a Village in India," Information Systems Research, INFORMS, vol. 24(2), pages 239-260, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:comaot:v:7:y:2001:i:4:d:10.1023_a:1013470632383. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.