A Faster Katz Status Score Algorithm

Authors: Foster K.C.¹; Muth S.Q.²; Potterat J.J.³; Rothenberg R.B.⁴

Source: Computational & Mathematical Organization Theory, Volume 7, Number 4, December 2001 , pp. 275-285(11)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

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

Language: English

Document Type: Regular paper

Affiliations: 1: Private Consultants, Colorado Springs, CO, USA 2: Private Consultants, Colorado Springs, CO, USA. smuth@qwest.net 3: El Paso County Department of Health, Colorado Springs, CO, USA. jjpotterat@qwest.net 4: Emory University School of Medicine, Atlanta, GA, USA. rrothen@emory.edu

Publication date: 2001-12-01