2001
DOI: 10.1111/0081-1750.00098
|View full text |Cite
|
Sign up to set email alerts
|

The Cohesiveness of Blocks In Social Networks: Node Connectivity and Conditional Density

Abstract: This study shows several ways that formal graph theoretic statements map patterns of network ties into substantive hypotheses

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
166
0
4

Year Published

2002
2002
2024
2024

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 238 publications
(174 citation statements)
references
References 40 publications
1
166
0
4
Order By: Relevance
“…Unable to reconcile their differences, the members of the club split into two factions, with one faction departing to start a separate club. It has been claimed repeatedly that by examining the pattern of friendships depicted in the network (which was compiled before the split happened) one can predict the membership of the two factions 14,20,26,27,[38][39][40] . Figure 3 shows the output of the hierarchical clustering procedure in the form of a tree or 'dendrogram' representing the order in which nodes are grouped together into communities.…”
Section: Hierarchical Clusteringmentioning
confidence: 99%
“…Unable to reconcile their differences, the members of the club split into two factions, with one faction departing to start a separate club. It has been claimed repeatedly that by examining the pattern of friendships depicted in the network (which was compiled before the split happened) one can predict the membership of the two factions 14,20,26,27,[38][39][40] . Figure 3 shows the output of the hierarchical clustering procedure in the form of a tree or 'dendrogram' representing the order in which nodes are grouped together into communities.…”
Section: Hierarchical Clusteringmentioning
confidence: 99%
“…"A group's structural cohesion is equal to the minimum number of actors who, if removed from the group, would disconnect the group" (Moody and White, 2003, p. 109). More formally (White and Harary, 2001), a maximal set S with respect to a property P is one for which every broader set containing S lacks property P, and a k-component is a maximal subgraph of a graph G that is k-connected. When we use the term multiconnectivity we are referring to k-connected graphs, their k-components, and the fact that all nodes in a k-component are k-connected.…”
Section: From Embeddedness To Cohesionmentioning
confidence: 99%
“…The algorithmic science of finding unique "strong boundaries" of cohesive network sub-groups, as proven mathematically for cohesive blocking (overlap detection for hybrid communities) is barely in its infancy. Yet White and Harary's (2001) time-series predictions of karate club member decisions are replicated in Estrada and Hatano's model, and serve as an example of precisely matching predictive models for how ties dissolve as a club splits in two during a conflict between leaders. For every population in which there are data on the kinds of elements that constitute a culture or subculture, tests can now be constructed using cohesive blocking models and also Estrada's community detection algorithm to predict consensus or other patterns of behavior.…”
Section: The Fallacy That Thought Depends On Languagementioning
confidence: 83%
“…Results are heavily dependent on mathematical theorems about graphs, networks, and relational algebra that capture "necessary connections" (see White 1974;White and Reitz 1983;White and Harary 2001) for results that are not prima facie visible to the observer, as either ethnographer, preceptor of a network graphic, or network participant. Local choices and subsequent behavior in networks, for example, have necessary implications for global features of networks, and vice versa.…”
Section: Deeper Problems: Mind Logics and Worldmentioning
confidence: 99%
See 1 more Smart Citation