Institute for Software Research
School of Computer Science, Carnegie Mellon University


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

Wei Wei, Jürgen Pfeffer, Jeffrey Reminga, Kathleen M. Carley

Auguste 2011


Center for the Computational Analysis of Social and Organizational Systems
CASOS Technical Report

Keywords: Weighted networks, asymmetric networks, self-looped networks, disconnected networks, degree centrality, closeness centrality, betweenness centrality, eigenvector centrality, clustering coefficient, ORA/UCINET measure comparison

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 Freeman's 1979 definitions before they calculate centrality measures. When dealing with weighted and/or 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.

34 pages

Return to: SCS Technical Report Collection
School of Computer Science

This page maintained by