The cohesiveness of blocks in social networks: Node connectivity and conditional density
Published Web Locationhttps://doi.org/10.1111/0081-1750.00098
This study shows several ways that formal graph theoretic statements map patterns of network ties into substantive hypotheses about social cohesion. If network cohesion is enhanced by multiple connections between members of a group, for example, then the higher the global minimum of the number of independent paths that connect every pair of nodes in the network, the higher the social cohesion. The cohesiveness of a group is also measured by the extent to which it is not disconnected by removal of 1, 2, 3, . . . , k actors. Menger's Theorem proves that these two measures are equivalent. Within this graph theoretic framework, we evaluate various concepts of cohesion and establish the validity of a pair of related measures:.