关于「结构洞:闭合与经纪」,《社会网络与结构洞》给出的定量结论是什么?
结论:科尔曼的闭合强调紧密的网络带来信任与约束,伯特的结构洞强调站在圈子之间带来信息与机会。网络约束衡量一个人被困在彼此相连的联系人中的程度,它取决于联系人之间是否相连,而不是联系人的多少;网络约束与介数中心性从不同角度衡量同一种「位置」,在合成网络中两者高度(负)相关但并不相同。伯特对 673 名经理的研究显示,跨越结构洞的人更可能提出被认为有价值的建议,也获得更好的薪酬与晋升;但在中国高科技企业中,在高承诺的组织文化里结构洞反而有害。下一章讨论,当传播的东西不是一条消息而是一种需要多人强化的行为时,桥还够不够。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库
| node | contacts | effective size | efficiency | constraint | largest c_ij |
|---|---|---|---|---|---|
| Ana | 4 | 1.00 | 0.25 | 0.733 | a1 0.191 |
| a2 | 4 | 1.00 | 0.25 | 0.733 | a1 0.191 |
| a1 | 5 | 2.60 | 0.52 | 0.530 | Ana 0.123 |
| Cy | 4 | 3.00 | 0.75 | 0.391 | b2 0.098 |
| Bo | 3 | 3.00 | 1.00 | 0.333 | a1 0.111 |
| benchmarks: n unconnected contacts give C = 1/n; a clique of 5 gives C = 0.766 |
核心公式
\[c_{ij} = \Big(p_{ij} + \sum_{q \neq i, j} p_{iq}\, p_{qj}\Big)^2\]
查看完整验算程序
# 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}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《社会网络拓扑、结构洞与复杂传染的数学模型》第 2 章「结构洞:闭合与经纪」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23764990
DOI: 10.5281/zenodo.23764990 · 阅读本章所在专著 · 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}
}