Accession Number:

ADA550859

Title:

Handling Weighted, Asymmetric, Self-Looped, and Disconnected Networks in ORA

Descriptive Note:

Technical rept.

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA INST OF SOFTWARE RESEARCH INTERNAT

Report Date:

2011-08-01

Pagination or Media Count:

35.0

Abstract:

When Linton C. Freeman made his conceptual clarifications about centrality measures in social network analysis in 1979 he exclusively focused on unweighted, symmetric, and connected networks without the possibility of self-loops. Even though a lot of articles have been published in the last years discussing network measures for weighted, asymmetric or unconnected networks, the vast majority of researchers dealing with social network data simplify their networks based on Freemans 1979 definitions before they calculate centrality measures. When dealing with weighted andor asymmetric networks which can have self links and consist of multiple components, researchers are confronted with a lack of standardization. Different tools for social network analysis treat specific cases differently. In this article we describe and discuss the ways the software ORA developed by CASOS at Carnegie Mellon University handles the most important network measures in case of weighted, asymmetric, self-looped, and disconnected networks. In the center of our attention are the following measures, degree centrality, closeness centrality, betweenness centrality, eigenvector centrality, and clustering coefficient.

Subject Categories:

  • Administration and Management
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE