Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs

By Garry Robins, Malcolm Alexander. Computational and mathematical organization theory, 2004

377 citations recorded by the source corpus.

How researchers see this paper

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

Networks beyond pairwise interactions: structure and dynamics (2020, background): “More complicated models controlling the distribution of short paths [168] or that add annotations [169] soon followed.”
Triadic closure in two-mode networks: Redefining the global and local clustering coefficients (2010, background): “To overcome this bias, a number of clustering coefficients for two-mode networks have been proposed in the literature (Lind et al., 2005; Latapy et al., 2008; Robins and Alexander, 2004; Zhang et al., 2008).”
Exponential random graph models for multilevel networks (2013, methodology): “The GCCs for the within-level networks (A, B) are calculated as the ratio between closed and open triads; whereas the GCC for the mesolevel network X is calculated as the ratio between the numbers of four-cycles and three-paths (Robins and Alexander, 2004).”
Manual for RSiena (2011, background): “Transitivity in two-mode networks is expressed in the first place by the number of four-cycles (Robins and Alexander, 2004).”