What does Multilateral Punishment in Merchant Networks conclude, in numbers, about “How Bad News Travels: SI Diffusion, Rings of Correspondents and Rumours that Stop”?

Answer: Chapter 3 compares the speed of news in well-mixed, ring and small-world networks and shows that a rumour which stops leaves 0.2032 of a large population unreached.

Scope of the numbers: Its agents, orders and network parameters are illustrative; all calculations are generated by its programs; the book is general business analysis, not business, legal or financial advice. Chapter 4 finds the critical group size: tens to over a hundred members in chain-like networks of acquaintances under illustrative parameters, but 33742 in a well-mixed network.

中文版

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.2032

large-N share never hearing: x = exp(-2(1-x)) = 0.2032
Nmean neverruns above 0.25smallestlargest
300.213454 of 2000.03450.8966
1000.202840 of 2000.07070.3636
3000.200615 of 2000.13040.2943
10000.20430 of 2000.16620.2452
unlike SI news, a rumour that is retold until it meets
someone who knows it leaves about a fifth unreached
Show the full program
# Chapter 3. p33: rumours that stop, the Daley-Kendall limit.
# Model (Maki-Thompson form of the Daley-Kendall rumour): one spreader
# in a mixed group of N. At each step a random spreader calls a random
# other member; an ignorant listener becomes a spreader, while a
# listener who already knows makes the caller stop (stifler). The
# large-N share that never hears solves x = exp(-2 (1 - x)). We compare
# with 200 fixed-seed runs per N. N values are illustrative.
# 模型:谣言模型中「听过的人让传话人住口」,永远听不到的比例。
import math
import random

RUNS = 200


def limit_share():
    x = 0.5
    for _ in range(200):
        x = math.exp(-2.0 * (1.0 - x))
    return x


def run(n, rng):
    state = [0] * n          # 0 ignorant, 1 spreader, 2 stifler
    state[0] = 1
    spreaders = [0]
    ignorant = n - 1
    while spreaders:
        k = rng.randrange(len(spreaders))
        s = spreaders[k]
        j = rng.randrange(n - 1)
        if j >= s:
            j += 1
        if state[j] == 0:
            state[j] = 1
            spreaders.append(j)
            ignorant -= 1
        else:
            state[s] = 2
            spreaders[k] = spreaders[-1]
            spreaders.pop()
    return ignorant / (n - 1)


if __name__ == "__main__":
    rng = random.Random(20261112)
    x = limit_share()
    print("large-N share never hearing: x = exp(-2(1-x)) = {:.4f}"
          .format(x))
    print("   N     mean never   runs above 0.25   smallest  largest")
    for n in (30, 100, 300, 1000):
        res = [run(n, rng) for _ in range(RUNS)]
        high = len([v for v in res if v > 0.25])
        print("  {:<5d}  {:.4f}       {:3d} of {}        {:.4f}    {:.4f}"
              .format(n, math.fsum(res) / RUNS, high, RUNS,
                      min(res), max(res)))
    print("unlike SI news, a rumour that is retold until it meets")
    print("someone who knows it leaves about a fifth unreached")

Single source and citation

Fan, Y. (2026). Multilateral Punishment in Merchant Networks: Maghribi Agency Games and Trust Networks in Buyer Communities (Version 1.0.0), Chapter 3: How Bad News Travels: SI Diffusion, Rings of Correspondents and Rumours that Stop. 5D Library. DOI pending

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

BibTeX
@book{fan2026222,
  author    = {Fan, Yafu},
  title     = {Multilateral Punishment in Merchant Networks: Maghribi Agency Games and Trust Networks in Buyer Communities},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book