What does Five Feeds, One Source conclude, in numbers, about “Facebook: Groups, Local Trust and Weak Ties, and Reach through Friend Networks”?

Answer: Chapter 5: seeds on people who span circles reach 15.36 people against 7.89 for seeds in one circle.

Scope of the numbers: Every platform claim is labelled as a dated official disclosure, peer-reviewed research or the book's illustrative model; its weights and funnel parameters are illustrative, not any platform's settings, and all calculations are generated by its programs. It is general business guidance, not legal, tax or investment advice.

中文版

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: 15.36, 7.89

240 people, 705 ties inside clusters, 100 bridging ties
one clustermean reach7.89 people, clusters touched 1.60
three clustersmean reach10.63 people, clusters touched 3.51
bridge peoplemean reach15.36 people, clusters touched 4.14
Show the full program
# Chapter 5. p51: where to seed a local post in a friend network of six clusters.
# Six clusters of 40 people (estates, schools, clubs); a tie inside a cluster exists
# with probability 0.15, between clusters with 0.004 (seeded random graph). A share
# passes along a tie with probability 0.12 (independent cascade). Three seeds are
# placed (a) in one cluster, (b) one each in three clusters, (c) on the three people
# with most cross-cluster ties. 500 seeded runs each. All parameters are illustrative.
import math
import random

RNG = random.Random(1973)
K, M, P_IN, P_OUT, P_SHARE, RUNS = 6, 40, 0.15, 0.004, 0.12, 500
N = K * M
adj = [[] for _ in range(N)]
for i in range(N):
    for j in range(i + 1, N):
        same = i // M == j // M
        if RNG.random() < (P_IN if same else P_OUT):
            adj[i].append(j)
            adj[j].append(i)
cross = [len([j for j in adj[i] if j // M != i // M]) for i in range(N)]
ties_in = len([1 for i in range(N) for j in adj[i] if j > i and j // M == i // M])
ties_out = len([1 for i in range(N) for j in adj[i] if j > i and j // M != i // M])
print("%d people, %d ties inside clusters, %d bridging ties" % (N, ties_in, ties_out))


def spread(seeds):
    active, frontier = set(seeds), list(seeds)
    while frontier:
        nxt = []
        for u in frontier:
            for v in adj[u]:
                if v not in active and RNG.random() < P_SHARE:
                    active.add(v)
                    nxt.append(v)
        frontier = nxt
    return len(active), len({u // M for u in active})


plans = {"one cluster": [0, 1, 2], "three clusters": [0, M, 2 * M],
         "bridge people": sorted(range(N), key=lambda i: (-cross[i], i))[:3]}
for name, seeds in plans.items():
    reach, clus = [], []
    for _ in range(RUNS):
        r, c = spread(seeds)
        reach.append(r)
        clus.append(c)
    print("%-15s mean reach %6.2f people, clusters touched %.2f" % (
        name, math.fsum(reach) / RUNS, math.fsum(clus) / RUNS))

Single source and citation

Fan, Y. (2026). Algorithmic Heterogeneity across RedNote, Threads, X, Instagram and Facebook: Cross-Platform Adaptation and Creator Aggregation (Version 1.0.0), Chapter 5: Facebook: Groups, Local Trust and Weak Ties, and Reach through Friend Networks. 5D Library. DOI pending

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

BibTeX
@book{fan2026359,
  author    = {Fan, Yafu},
  title     = {Algorithmic Heterogeneity across RedNote, Threads, X, Instagram and Facebook: Cross-Platform Adaptation and Creator Aggregation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book