What does Compliant Referral Commissions conclude, in numbers, about “Referral Trees: Expected Size in a Branching Process and Saturation in a Finite Market”?

Answer: Chapter 3 uses a branching process to show that referral chains extend on single-tier rewards, the first generation being only 0.4196 of new buyers within six generations, and that in a finite market the largest cohort brings in only 0.876 people each.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; the book is not individual legal, tax or financial advice, and regulations are given only in gist, subject to human review of the text in force before publication. Marked boxes separate published evidence, runnable Python calculations (17 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.4196

expected new buyers per seed customer, by depth of the tree
R depth1 depth2 depth6 total extinct leaves
0.30.300 0.390 0.428 0.429 1.0000 0.7408
0.60.600 0.960 1.430 1.500 1.0000 0.5488
0.90.900 1.710 4.217 9.000 1.0000 0.4066
1.21.200 2.640 11.916 inf 0.6863 0.3012
Monte Carlo R0.6, six generations: mean 1.409
exact six-generation value1.430
share of six-generation buyers in depth 1 at R0.6: 0.4196
Show the full program
# Chapter 3. p31: expected size of a referral tree, by depth.
# Galton-Watson branching (Watson and Galton 1875): every buying
# customer brings in a Poisson(R) number of new buying customers.
# Expected new buyers in generation k: R^k. Extinction probability q
# solves q = exp(R*(q - 1)). Share of buyers who refer nobody: e^-R.
# Monte Carlo check at R = 0.6 with a fixed seed (20,000 seeds, six
# generations). R values are illustrative.
import math
import random


def gens(R, depth):
    return [R ** k for k in range(1, depth + 1)]


def extinction(R):
    q = 0.0
    for _ in range(2000):
        q = math.exp(R * (q - 1.0))
    return q


def poisson(rng, lam):
    # Knuth 法:乘均匀数直到小于 e^-lam
    lim, k, p = math.exp(-lam), 0, 1.0
    while True:
        p *= rng.random()
        if p < lim:
            return k
        k += 1


print("expected new buyers per seed customer, by depth of the tree")
print("    R  depth1  depth2  depth6   total  extinct  leaves")
for R in (0.3, 0.6, 0.9, 1.2):
    g = gens(R, 6)
    tot = R / (1.0 - R) if R < 1.0 else float("inf")
    print("{:5.1f} {:7.3f} {:7.3f} {:7.3f} {:7.3f} {:8.4f} {:7.4f}".format(
        R, g[0], math.fsum(g[:2]), math.fsum(g), tot, extinction(R),
        math.exp(-R)))
rng = random.Random(20261113)
sizes = []
for _ in range(20000):
    alive, total = 1, 0
    for _ in range(6):
        nxt = 0
        for _ in range(alive):
            nxt += poisson(rng, 0.6)  # step
        total += nxt  # step
        alive = nxt
        if alive == 0:
            break
    sizes.append(total)
mean = math.fsum(sizes) / len(sizes)
print("Monte Carlo R = 0.6, six generations: mean {:.3f}".format(mean))
print("exact six-generation value:        {:.3f}".format(
    math.fsum(gens(0.6, 6))))
d1 = gens(0.6, 1)[0] / math.fsum(gens(0.6, 6))
print("share of six-generation buyers in depth 1 at R = 0.6: {:.4f}"
      .format(d1))

Single source and citation

Fan, Y. (2026). Incentive-Compatible Compliant Referral Programmes: Commission Slopes in a Principal-Agent Model, a Second-Tier Slope of Zero and Maximal Referrals within Anti-Pyramid Limits (Version 1.0.0), Chapter 3: Referral Trees: Expected Size in a Branching Process and Saturation in a Finite Market. 5D Library. DOI pending

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

BibTeX
@book{fan2026279,
  author    = {Fan, Yafu},
  title     = {Incentive-Compatible Compliant Referral Programmes: Commission Slopes in a Principal-Agent Model, a Second-Tier Slope of Zero and Maximal Referrals within Anti-Pyramid Limits},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book