What does Social Networks and Structural Holes conclude, in numbers, about “Structural Holes: Closure and Brokerage”?

Answer: Coleman's closure stresses that dense networks bring trust and sanctions; Burt's structural holes stress that standing between circles brings information and opportunity. Network constraint measures how far a person is trapped among mutually connected contacts; it depends on whether the contacts are connected, not on how many there are. Network constraint and betweenness centrality measure the same kind of "position" from different angles; in a synthetic network they are strongly (negatively) correlated but not identical. Burt's study of 673 managers shows that those who span structural holes are more likely to put forward ideas judged valuable and to enjoy better pay and promotion; but in Chinese high-tech firms structural holes were harmful where the organisational culture emphasised high commitment. The next chapter asks whether bridges are enough when what spreads is not a piece of news but a behaviour that needs reinforcement from several people.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (15 programs, all checked), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python only

nodecontactseffective sizeefficiencyconstraintlargest c_ij
Ana41.000.250.733a1 0.191
a241.000.250.733a1 0.191
a152.600.520.530Ana 0.123
Cy43.000.750.391b2 0.098
Bo33.001.000.333a1 0.111
benchmarks: n unconnected contacts give C = 1/n; a clique of 5 gives C = 0.766

Key formula

\[c_{ij} = \Big(p_{ij} + \sum_{q \neq i, j} p_{iq}\, p_{qj}\Big)^2\]
Show the full program
# Burt's network constraint and effective size on a small invented network.
# Three groups of four (a, b, c) are cliques. Ana is a fifth member of group a
# (tied to all of a1-a4). Bo is tied to one person in each group (a1, b1, c1).
# Cy is tied to two people in group b and two in group c (b2, b3, c2, c3).
# For binary undirected ties p_ij = 1/k_i (Burt 1992). Dyadic constraint
#   c_ij = (p_ij + sum over q != i, j of p_iq * p_qj) ** 2,  C_i = sum_j c_ij.
# Effective size = n - 2t/n (t = ties among the n contacts; Borgatti 1997).
from itertools import combinations
groups = {g: [f"{g}{i}" for i in range(1, 5)] for g in "abc"}
ties = set()
for members in groups.values():
    ties |= {tuple(sorted(e)) for e in combinations(members, 2)}
ties |= {("Ana", x) for x in groups["a"]}
ties |= {("Bo", x) for x in ("a1", "b1", "c1")}
ties |= {("Cy", x) for x in ("b2", "b3", "c2", "c3")}
nb = {}
for u, v in ties:
    nb.setdefault(u, set()).add(v); nb.setdefault(v, set()).add(u)

def p(i, j):
    return 1 / len(nb[i]) if j in nb[i] else 0.0

def dyadic(i, j):
    return (p(i, j) + sum(p(i, q) * p(q, j) for q in sorted(nb[i]) if q != j)) ** 2

def constraint(i):
    return sum(dyadic(i, j) for j in sorted(nb[i]))

def effective_size(i):
    n = len(nb[i])
    t = sum(1 for u, v in combinations(nb[i], 2) if v in nb[u])
    return n - 2 * t / n

print("node  contacts  effective size  efficiency  constraint  largest c_ij")
for i in ("Ana", "a2", "a1", "Cy", "Bo"):
    n, es = len(nb[i]), effective_size(i)
    j = max(sorted(nb[i]), key=lambda x: dyadic(i, x))
    print(f" {i:4s} {n:6d} {es:13.2f} {es / n:12.2f} {constraint(i):11.3f}"
          f"     {j} {dyadic(i, j):.3f}")
print("benchmarks: n unconnected contacts give C = 1/n;"
      f" a clique of 5 gives C = {4 * (0.25 + 3 / 16) ** 2:.3f}")

Single source and citation

Fan, Y. (2026). Social Network Topology, Structural Holes and Complex Contagion (Version 1.0.0), Chapter 2: Structural Holes: Closure and Brokerage. 5D Library. https://doi.org/10.5281/zenodo.23764990

DOI: 10.5281/zenodo.23764990 · Read the monograph · 5DL-B-025 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026025,
  author    = {Fan, Yafu},
  title     = {Social Network Topology, Structural Holes and Complex Contagion},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23764990},
  url       = {https://doi.org/10.5281/zenodo.23764990}
}

Other chapter answers in this book