Structural cohesion  

From The Art and Popular Culture Encyclopedia

Jump to: navigation, search

Related e

Wikipedia
Wiktionary
Shop


Featured:

Structural cohesion is the sociological conception 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. 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.


See also




Unless indicated otherwise, the text in this article is either based on Wikipedia article "Structural cohesion" or another language Wikipedia page thereof used under the terms of the GNU Free Documentation License; or on research by Jahsonic and friends. See Art and Popular Culture's copyright notice.

Personal tools