A Faster Katz Status Score Algorithm

Kurt C. Foster, Stephen Q. Muth (), John J. Potterat () and Richard B. Rothenberg ()
Additional contact information
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

Computational and Mathematical Organization Theory, 2001, vol. 7, issue 4, No 1, 275-285

Abstract: 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.

Keywords: graph theory; centrality; rank prestige; influence; Katz status (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1023/A:1013470632383 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:comaot:v:7:y:2001:i:4:d:10.1023_a:1013470632383

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10588

DOI: 10.1023/A:1013470632383

Access Statistics for this article

Computational and Mathematical Organization Theory is currently edited by Terrill Frantz and Kathleen Carley

More articles in Computational and Mathematical Organization Theory from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().