What does Structural Holes, Knowledge Transfer and Inspiration conclude, in numbers, about “Structural Holes: Where Bridging Ideas Come From”?

Answer: Chapter 1 computes Burt's constraint: spanning a structural hole lowers it from 0.629 to 0.360, and in a clustered network of researchers rewiring 0.01 of ties cuts the mean distance from 17.09 steps to 9.98.

Scope of the numbers: Its networks, fields, scores and potentials are illustrative models; all calculations are generated by its programs; the book is not investment, medical or psychological advice. Marked boxes separate published evidence, runnable Python calculations (16 programs), 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 onlyprinted values that match the answer: 0.01, 17.09, 9.98

rewiring pclusteringmean pathlong ties
0.000.60017.090
0.010.5849.986
0.050.5195.2430
0.200.3203.76120
1.000.0243.15600
Show the full program
# Chapter 1. p02: How few bridges it takes. A ring of 200 researchers,
# each tied to the 3 nearest on each side, has high clustering and long
# paths. Rewire each tie with chance p to a random researcher (Watts and
# Strogatz). We print clustering and mean shortest path; a handful of
# long ties shortens paths sharply while clustering barely moves.
# Fixed seed 102; averages over 10 networks.
import math
import random
from collections import deque

rng = random.Random(102)
N, K = 200, 3

def ring(p):
    edges = set()
    for i in range(N):
        for d in range(1, K + 1):
            a, b = i, (i + d) % N
            if rng.random() < p:
                while True:
                    b = rng.randrange(N)
                    e = (min(a, b), max(a, b))
                    if b != a and e not in edges:
                        break
            edges.add((min(a, b), max(a, b)))
    g = [set() for _ in range(N)]
    for a, b in edges:
        g[a].add(b)
        g[b].add(a)
    return g

def clustering(g):
    cs = []
    for nb in g:
        k = len(nb)
        if k < 2:
            continue
        links = sum(1 for u in nb for v in nb if u < v and v in g[u])
        cs.append(links / (k * (k - 1) / 2))
    return math.fsum(cs) / len(cs)

def mean_path(g):
    tot = cnt = 0
    for s in range(N):
        dist = {s: 0}
        q = deque([s])
        while q:
            u = q.popleft()
            for v in g[u]:
                if v not in dist:
                    dist[v] = dist[u] + 1
                    q.append(v)
        tot += sum(dist.values())
        cnt += len(dist) - 1
    return tot / cnt

if __name__ == "__main__":
    print("   rewiring p   clustering   mean path   long ties")
    for p in (0.0, 0.01, 0.05, 0.2, 1.0):
        c = m = 0.0
        for _ in range(10):
            g = ring(p)
            c += clustering(g) / 10
            m += mean_path(g) / 10
        print("   {:10.2f}   {:10.3f}   {:9.2f}   {:9.0f}".format(
            p, c, m, p * N * K))

Single source and citation

Fan, Y. (2026). Cross-Disciplinary Structural Holes, Functorial Knowledge Transfer and Inspiration Stochastic Resonance (Version 1.0.0), Chapter 1: Structural Holes: Where Bridging Ideas Come From. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-102 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026102,
  author    = {Fan, Yafu},
  title     = {Cross-Disciplinary Structural Holes, Functorial Knowledge Transfer and Inspiration Stochastic Resonance},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book