Closeness Centrality In Networks With Disconnected Components

This 2010 post focuses on the distance between nodes within social networks and particularly those with disconnected components. Key node centrality is defined by the author as the inverse of farness, and in turn, the sum of distances to all other nodes within a given network structure. The author argues that this measure can not normally be applied to networks with disconnected components. This post in turn highlights a possible work-around that allows the measure to be applied to networks with disconnected components. The post is followed by comments of researchers engaging with the author, and is an insightful resource.

This article will be of use to researchers and practitioners interested in closeness centrality in network structures, and particularly tackling some of the challenges associated with closeness centrality in networks with disconnected components.