 | This article may be too technical for most readers to understand. (August 2016) |
In sociology, structural cohesion is the conception[1][2] of a useful formal definition and measure of cohesion in social groups. It is defined as the minimal number of actors in a social network that need to be removed to disconnect the group. It is thus identical to the question of the node connectivity of a given graph in discrete mathematics. The vertex-cut version of Menger's theorem also proves that the disconnection number is equivalent to a maximally sized group with a network in which every pair of persons has at least this number of separate paths between them. It is also useful to know that k-cohesive graphs (or k-components) are always a subgraph of a k-core, although a k-core is not always k-cohesive. A k-core is simply a subgraph in which all nodes have at least k neighbors but it need not even be connected.
The boundaries of structural endogamy in a kinship group are a special case of structural cohesion.
- ^ N, T; White, Douglas (2003). "Structural Cohesion and Embeddedness: A Hierarchical Concept of Social Groups" (PDF). American Sociological Review. 68 (1): 1–25. doi:10.2307/3088904. JSTOR 3088904. Archived from the original (PDF) on 2006-09-27. Retrieved 2006-08-19.
- ^ White, Douglas; Frank Harary (2001). "The Cohesiveness of Blocks in Social Networks: Node Connectivity and Conditional Density" (book). Sociological Methodology. 31 (1): 305–359. CiteSeerX 10.1.1.304.3296. doi:10.1111/0081-1750.00098. S2CID 15806800. Retrieved 2012-08-13.