A Faster Katz Status Score Algorithm

Authors:
Kurt C. Foster;Stephen Q. Muth;John J. Potterat;Richard B. Rothenberg
Affiliations:
Private Consultants, Colorado Springs, CO, USA;Private Consultants, Colorado Springs, CO, USA. smuth@qwest.net;El Paso County Department of Health, Colorado Springs, CO, USA. jjpotterat@qwest.net;Emory University School of Medicine, Atlanta, GA, USA. rrothen@emory.edu
Venue:
Computational & Mathematical Organization Theory
Year:
2001

Citing 1
Cited 5

Running Microsoft Windows NT Workstation, Version 4

Running Microsoft Windows NT Workstation, Version 4

Fast and accurate link prediction in social networking systems

Journal of Systems and Software
A survey on proximity measures for social networks

Search Computing
Folksonomy link prediction based on a tripartite graph for tag recommendation

Journal of Intelligent Information Systems
Community detection algorithm based on centrality and node distance in scale-free networks

Proceedings of the 24th ACM Conference on Hypertext and Social Media
High efficiency and quality: large graphs matching

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new graph theoretical algorithm to calculate Katz status scores reduces computational complexity from time iO(in3) to iO(in + im). 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.