A Method for Detecting Structure in Sociometric Data

By Paul Holland, S. Leinhardt. 1970

Subfields: Network Science & Complex Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Network Science & Complex Systems

Citations in the corpus

Personal network integration: transitivity and homophily in strong-tie relations (2000, background): “Holland and Leinhardt, 1970, 1971 .”
The Strength of Weak Ties (1973, unknown): “…the model of this paper to one with which it shares many similarities, that of James Davis, Paul Holland, and Samuel Leinhardt (hereafter, the DHL model) (Davis 1970; Davis and Leinhardt 1971; Holland and Leinhardt 1970, 197 la, 1971 b; Davis, Holland, and Leinhardt 1971; Leinhardt 1972).”
Patterns and dynamics of users' behavior and interaction: Network analysis of an online community (2009, background): “This symmetry among triples of nodes is often referred to as transitivity (Davis, 1970; Holland & Leinhardt, 1970; Levine & Kurzban, 2006; Rapaport, 1953; Wasserman & Faust, 1994).”
Comparing Brain Networks of Different Size and Connectivity Density Using Graph Theory (2010, background): “We here highlight social networks where the application of graph theory has a long tradition ([54,55], and see e.g., [56,57] for recent reviews).”
Understanding network formation in strategy research: Exponential random graph models (2016, background): “The third plot shows the distribution of the triad census, which captures 16 different forms of triads (see Holland and Leinhardt, 1970, for details on the 16 triad forms).”
Social Network Analysis with sna (2008, unknown): “…each class within a graph is known as its dyad census, and has been used as a simple basis for modeling network structure at least since the work of Holland and Leinhardt (1970). rguman can be employed either to generate uniform digraphs conditional on an exact dyad census constraint, Social…”
Clustering in weighted networks (2009, background): “Evidence suggests that in most real-world networks, and especially social networks, nodes tend to cluster into densely connected groups (Feld, 1981; Friedkin, 1984; Holland and Leinhardt, 1970; Louch, 2000; Simmel, 1923; Snijders, 2001; Snijders et al., 2006; Watts and Strogatz, 1998).”
Finding and Characterizing Information Warfare Campaigns (2020, background): “Several seminal works describe the importance of triadic relationships in social networks [57, 123] and as a foundation for measuring network clustering and groups [129].”
Social network analysis: A methodological introduction (2008, methodology): “The use of these concepts within the social network literature extends back at least to Holland and Leinhardt (1970) and related papers, and accompany a corresponding history within the mathematical literature in graph theory; recent reinventions under names such as ‘motifs’ or ‘graphlets’ do not al”
Model‐based clustering for social networks (2007, background): “A natural example with relevance to the present paper would be systems of ranked clusters (Davis and Leinhardt, 1972; Holland and Leinhardt, 1970), in which we observe multiple cohesive social groups whose intergroup connections form a partial order.”
A social network perspective on measurements of dominance hierarchies (2012, methodology): “Our approach is based on the triad census, a tool commonly used in social network analysis to count directly the frequencies of all triadic configurations in the data (Figures 1 & A1; Holland and Leinhardt, 1970, 1976; Wasserman and Faust, 1994; Faust, 2007).”
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas (2018, background): “The same physics conclusions as Houtappel’s (1950a), (1950b) for a signed, weighted triangular lattice. [See also I. Syôzi (1950a), Wannier (1950a).] [Annot.”
Triadic closure in two-mode networks: Redefining the global and local clustering coefficients (2010, background): “Evidence suggests that in most real-world networks, and especially in social networks, nodes cluster into densely connected groups (Holland and Leinhardt, 1970; Opsahl and Panzarasa, 2009).”