www.fgks.org   »   [go: up one dir, main page]

Jump to content

Structural cohesion: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m →‎top: cap
Citation bot (talk | contribs)
Add: s2cid. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 562/3850
 
(10 intermediate revisions by 8 users not shown)
Line 1: Line 1:
{{Short description|Lowest number of people removed to disconnect a social group}}
{{technical|date=August 2016}}
{{technical|date=August 2016}}

'''Structural cohesion''' is the sociological conception<ref>
In [[sociology]], '''structural cohesion''' is the conception<ref>
{{cite journal
{{cite journal
| last = N
|last = N
| first = T
|first = T
|author2=White, Douglas |authorlink2=Douglas R. White
|author2 = White, Douglas
|authorlink2 = Douglas R. White
| title = Structural Cohesion and Embeddedness: A Hierarchical Concept of Social Groups.
|title = Structural Cohesion and Embeddedness: A Hierarchical Concept of Social Groups.
| journal = [[American Sociological Review]]
|journal = [[American Sociological Review]]
| volume = 68
|volume = 68
| issue = 1
|issue = 1
| pages = 1–25
|pages = 1–25
| year = 2003
|year = 2003
|url = http://www2.asanet.org/journals/ASRFeb03MoodyWhite.pdf
| publisher =
|access-date = 2006-08-19
| url = http://www2.asanet.org/journals/ASRFeb03MoodyWhite.pdf
|doi = 10.2307/3088904
| format = [[PDF]]
|url-status = dead
| id =
|archive-url = https://web.archive.org/web/20060927142539/http://www2.asanet.org/journals/ASRFeb03MoodyWhite.pdf
| accessdate = 2006-08-19
|archive-date = 2006-09-27
| doi=10.2307/3088904}}</ref><ref>
|jstor = 3088904
}}</ref><ref>
{{cite journal
{{cite journal
| last = White
| last = White
| first = Douglas
| first = Douglas
| authorlink = Douglas R. White
| authorlink = Douglas R. White
|author2=[[Frank Harary]]
|author2=Frank Harary
| title = The Cohesiveness of Blocks in Social Networks: Node Connectivity and Conditional Density.
| title = The Cohesiveness of Blocks in Social Networks: Node Connectivity and Conditional Density.
| journal = Sociological Methodology 2001
| journal = Sociological Methodology
| volume = 31
| volume = 31
| issue = 1
| issue = 1
| pages = 305–359
| pages = 305–359
| year = 2001
| year = 2001
| publisher = Blackwell Publishers, Inc., Boston, USA and Oxford, UK.
| url = http://eclectic.ss.uci.edu/~drwhite/sm-w23.PDF
| url = http://eclectic.ss.uci.edu/~drwhite/sm-w23.PDF
| format = book
| format = book
| id =
| id =
| accessdate = 2012-08-13
| access-date = 2012-08-13
| doi = 10.1111/0081-1750.00098 | citeseerx = 10.1.1.304.3296
| doi = 10.1111/0081-1750.00098 }}</ref> of a useful formal definition and measure of [[Social cohesion|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 (graph theory)|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.
| s2cid = 15806800
| author2-link = Frank Harary
}}</ref> of a useful formal definition and measure of [[Social cohesion|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 (graph theory)|connectivity]] of a given [[Graph (discrete mathematics)|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 {{mvar|k}}-cohesive graphs (or {{mvar|k}}-components) are always a subgraph of a [[k-core|{{mvar|k}}-core]], although a {{mvar|k}}-core is not always {{mvar|k}}-cohesive. A {{mvar|k}}-core is simply a subgraph in which all nodes have at least {{mvar|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.


== Software ==
== Software ==


[http://intersci.ss.uci.edu/wiki/index.php/Cohesive_blocking Cohesive.blocking] is the R program for computing structural cohesion according to the Moody-White (2003) [[algorithm]]. This wiki site provides numerous examples and a tutorial for use with R.
[https://web.archive.org/web/20080313044932/http://intersci.ss.uci.edu/wiki/index.php/Cohesive_blocking Cohesive.blocking] is the R program for computing structural cohesion according to the Moody-White (2003) [[algorithm]]. This wiki site provides numerous examples and a tutorial for use with R.


== Examples ==
== Examples ==
Line 63: Line 72:
{{Social networking}}
{{Social networking}}


[[Category:Social networks]]
[[Category:Social network analysis]]
[[Category:Graph connectivity]]
[[Category:Graph connectivity]]
[[Category:Network analysis]]
[[Category:Network analysis]]

Latest revision as of 14:43, 8 December 2022

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.

Software[edit]

Cohesive.blocking is the R program for computing structural cohesion according to the Moody-White (2003) algorithm. This wiki site provides numerous examples and a tutorial for use with R.

Examples[edit]

Some illustrative examples are presented in the gallery below:

Perceived cohesion[edit]

Perceived Cohesion Scale (PCS) is a six item scale that is used to measure structural cohesion in groups. In 1990, Bollen and Hoyle used the PCS and applied it to a study of large groups which were used to assess the psychometric qualities of their scale.[3]

See also[edit]

References[edit]

  1. ^ 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.
  2. ^ 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.
  3. ^ Chin, Wynne W., et al. Perceived Cohesion: A Conceptual and Empirical Examination: Adapting and Testing the Perceived Cohesion Scale in a Small-Group Setting. 1999. Small Group Research 30(6):751-766.