关于「弱连带的力量与小世界」,《社会网络与结构洞》给出的定量结论是什么?

结论:格兰诺维特的论证从「被禁止的三元组」推出强连带很少是桥,桥多半是弱连带;他的找工作数据来自 54 人的子样本,显示帮上忙的人多数是不常见面的熟人。邻域重叠把这一论证变成可以计算的量:低重叠的连带带来新颖的信息,并维系着整个网络的连通。瓦茨—斯托加茨模型显示,少量捷径就能让路径长度大降而聚类几乎不变。脸书与领英的大规模研究表明,弱连带的总体作用主要来自数量,单条连带最有用的是中等强度。下一章从连带转向位置:站在圈子之间的空隙上意味着什么。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

600 people, 2405 ties2255 inside groups, 150 between
mean overlap novelty of the contact's other contacts
inside-group ties0.230 0.627
between-group ties0.001 0.998
largest component (share of people) after removing a share of ties:
removed low overlap first random high overlap first
0%1.00 1.00 1.00
3%1.00 1.00 1.00
6%0.99 1.00 1.00
8%0.93 1.00 1.00
10%0.26 1.00 1.00
20%0.03 1.00 1.00
40%0.03 1.00 0.99

核心公式

\[O_{ij} = \frac{n_{ij}}{(k_i - 1) + (k_j - 1) - n_{ij}}\]
查看完整验算程序
# Bridges, closed triangles and redundant information (Granovetter 1973;
# Onnela et al. 2007). Synthetic network: 30 groups of 20 people, dense inside
# each group (tie probability 0.4) plus 150 random ties between groups.
# Neighbourhood overlap of tie i-j: shared contacts / (k_i - 1 + k_j - 1 - shared).
# "Novelty" of j for i: share of j's other contacts that i does not know.
# Then ties are removed in order of overlap (lowest first or highest first)
# and the largest connected component is tracked. Illustrative parameters.
import random
rng = random.Random(2)
G, S, P_IN, N_BETWEEN = 30, 20, 0.4, 150
N = G * S
nb = [set() for _ in range(N)]
for g in range(G):
    m = range(g * S, (g + 1) * S)
    for a in m:
        for b in m:
            if a < b and rng.random() < P_IN:
                nb[a].add(b); nb[b].add(a)
added = 0
while added < N_BETWEEN:
    a, b = rng.randrange(N), rng.randrange(N)
    if a // S != b // S and b not in nb[a]:
        nb[a].add(b); nb[b].add(a); added += 1
edges = [(a, b) for a in range(N) for b in nb[a] if a < b]

def overlap(a, b):
    sh = len(nb[a] & nb[b]); den = len(nb[a]) - 1 + len(nb[b]) - 1 - sh
    return sh / den if den > 0 else 0.0

def novelty(a, b):          # share of b's other contacts unknown to a
    others = nb[b] - {a}
    return len(others - nb[a]) / len(others) if others else 0.0

inside = [e for e in edges if e[0] // S == e[1] // S]
across = [e for e in edges if e[0] // S != e[1] // S]
mean = lambda xs: sum(xs) / len(xs)
print(f"{N} people, {len(edges)} ties: {len(inside)} inside groups,"
      f" {len(across)} between")
print("                     mean overlap   novelty of the contact's other contacts")
for name, es in (("inside-group ties", inside), ("between-group ties", across)):
    nov = mean([novelty(a, b) for a, b in es] + [novelty(b, a) for a, b in es])
    print(f"  {name:18s}  {mean([overlap(*e) for e in es]):10.3f}   {nov:8.3f}")

def giant(keep):
    par = list(range(N))
    def find(x):
        while par[x] != x:
            par[x] = par[par[x]]; x = par[x]
        return x
    for a, b in keep:
        ra, rb = find(a), find(b)
        if ra != rb: par[ra] = rb
    size = {}
    for x in range(N):
        r = find(x); size[r] = size.get(r, 0) + 1
    return max(size.values()) / N

order = sorted(edges, key=lambda e: (overlap(*e), rng.random()))
shuffled = edges[:]; rng.shuffle(shuffled)
print("largest component (share of people) after removing a share of ties:")
print("  removed   low overlap first    random    high overlap first")
for f in (0.0, 0.03, 0.06, 0.08, 0.1, 0.2, 0.4):
    k = int(f * len(edges))
    low, rnd = giant(order[k:]), giant(shuffled[k:])
    high = giant(order[:len(edges) - k])
    print(f"   {f:4.0%}        {low:6.2f}          {rnd:6.2f}        {high:6.2f}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《社会网络拓扑、结构洞与复杂传染的数学模型》第 1 章「弱连带的力量与小世界」(版本 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}
}

本书其他章节结论