What does Social Networks and Structural Holes conclude, in numbers, about “Information Cascades and How to Break Them”?

Answer: Take \(p = 0.7\) and the coin rule: once just two people have chosen, the probability that a cascade has already formed is 0.79, and the probability of a wrong cascade 0.195; by the tenth person a cascade has almost certainly formed, the probability of a wrong cascade is 0.247, and it changes no further. Even though everyone's private information is right seven times out of ten, the group as a whole has about a one-in-four chance of going wrong together, and once it has gone wrong it does not correct itself. The rule of following one's own signal produces fewer wrong cascades (0.155), because indifferent people still reveal their signals and cascades form more slowly. The more accurate the signals, the fewer the wrong cascades, but even with \(p = 0.8\) the coin rule gives 14 % wrong cascades. The simulation (0.246) agrees with the exact calculation (0.247).

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 onlyprinted values that match the answer: 0.155, 0.195, 0.246, 0.247, 0.7, 0.79

rule 'coin': P(cascade started) / P(wrong cascade) after n people
pn = 2n = 4n = 10n = 20limit (wrong)
0.60.76/0.2800.94/0.3471.00/0.3681.00/0.3680.368
0.70.79/0.1950.96/0.2361.00/0.2471.00/0.2470.247
0.80.84/0.1200.97/0.1391.00/0.1431.00/0.1430.143
rule 'own': P(cascade started) / P(wrong cascade) after n people
pn = 2n = 4n = 10n = 20limit (wrong)
0.60.52/0.1600.77/0.2370.97/0.3001.00/0.3070.308
0.70.58/0.0900.82/0.1280.99/0.1531.00/0.1550.155
0.80.68/0.0400.90/0.0531.00/0.0591.00/0.0590.059
Monte Carlo check (p = 0.7, n = 20, coin): wrong cascade 0.246, exact 0.247
Show the full program
# Information cascades in the Bikhchandani-Hirshleifer-Welch (1992) model.
# The true state is "good" (assumed here; the other case is symmetric). Each
# person privately gets a signal that is right with probability p, sees all
# earlier choices, and chooses by Bayes' rule. Before a cascade every choice
# reveals a signal, so the state is the lead d = (good signals) - (bad signals)
# shown so far. Once |d| = 2 everyone imitates: an up (correct) or down (wrong)
# cascade. A person whose own signal exactly cancels the lead is indifferent:
#   "coin": flips a coin, as in BHW;   "own": follows the own signal.
import random

def cascade_probs(p, n, rule):
    st = {-1: 0.0, 0: 1.0, 1: 0.0, "up": 0.0, "down": 0.0}
    for _ in range(n):
        new = {-1: 0.0, 0: 0.0, 1: 0.0, "up": st["up"], "down": st["down"]}
        new[1] += st[0] * p; new[-1] += st[0] * (1 - p)
        h = 0.5 if rule == "coin" else 0.0    # chance an indifferent person herds
        new["up"] += st[1] * (p + (1 - p) * h); new[0] += st[1] * (1 - p) * (1 - h)
        new["down"] += st[-1] * ((1 - p) + p * h); new[0] += st[-1] * p * (1 - h)
        st = new
    return st["up"], st["down"]

def limit_wrong(p, rule):
    if rule == "coin":
        return 1 - p * (1 + p) / (2 * (1 - p + p * p))
    return (1 - p) ** 2 / (p * p + (1 - p) ** 2)

for rule in ("coin", "own"):
    print(f"rule '{rule}': P(cascade started) / P(wrong cascade) after n people")
    print("   p     n = 2        n = 4        n = 10       n = 20    limit (wrong)")
    for p in (0.6, 0.7, 0.8):
        cells = []
        for n in (2, 4, 10, 20):
            up, down = cascade_probs(p, n, rule)
            cells.append(f"{up + down:.2f}/{down:.3f}")
        lim = limit_wrong(p, rule)
        print(f"  {p:.1f}   " + "   ".join(cells) + f"    {lim:.3f}")

rng = random.Random(12)
def simulate(p, n, rule):        # check by brute force with explicit counting
    d = 0
    for _ in range(n):
        good = rng.random() < p
        if d >= 2 or d <= -2:
            continue
        s = 1 if good else -1
        if d + s == 0 and d != 0:
            herd = rule == "coin" and rng.random() < 0.5
            d = d + (2 * d if herd else s)    # herd: |d| becomes 2 (cascade)
        else:
            d += s
    return d <= -2
sims = 200000
wrong = sum(simulate(0.7, 20, "coin") for _ in range(sims)) / sims
print(f"Monte Carlo check (p = 0.7, n = 20, coin): wrong cascade {wrong:.3f},"
      f" exact {cascade_probs(0.7, 20, 'coin')[1]:.3f}")

Single source and citation

Fan, Y. (2026). Social Network Topology, Structural Holes and Complex Contagion (Version 1.0.0), Chapter 6: Information Cascades and How to Break Them. 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