What does Cascades, Curiosity and Paywalls conclude, in numbers, about “The Branching Process of "Invite to Unlock"”?

Answer: Chapter 1 writes "invite friends to unlock free" and "pay and earn a commission" as a Galton-Watson branching process: a sharer stops at the threshold, so the share rate caps K, and at share rates of 30 % or 50 % no threshold takes K past 1; even at K = 1.15 a single seed dies out with probability 0.729, and the median cascade is 3 users.

Scope of the numbers: It is not business, legal or investment advice; all data are synthetic, generated by its programs. 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: 30, 50

s0 = 0.30 m K at q = 0.15 ceiling q* for K = 1
10.3380.350never
20.4340.480never
30.4170.512never
40.3520.491never
50.2800.445never
60.2180.390never
s0 = 0.50 m K at q = 0.15 ceiling q* for K = 1
10.5310.550never
20.6900.767never
30.6610.820never
40.5530.786never
50.4330.709never
60.3310.617never
s0 = 0.80 m K at q = 0.15 ceiling q* for K = 1
10.8190.850never
21.0741.1960.124
31.0281.2820.143
40.8541.2270.192
50.6621.1040.283
60.4990.957never
pay channel alone contributes 0.050
Reading: a sharer brings at most m joiners, so the share rate
caps K. With 30 % or 50 % of users willing to share, no unlock
threshold and no acceptance rate reaches K = 1. Only when most
users share does K cross 1, at a moderate threshold (m = 2 to 3)
and an acceptance rate that the table states exactly.

Key formula

\[K = s(m)\, \mathrm{E}\big[\min(\mathrm{Bin}(N, q),\, m)\big] + b \times 10 \times 0.10 .\]
Show the full program
# Chapter 1. The reproduction number of a two-channel referral funnel.
# A new user sees a free teaser and then takes one of three paths:
#   share path  (prob s(m)): to unlock the full reading they invite contacts
#               one by one, each accepting with prob q, until m have joined
#               or N = 20 invitations are used up; offspring min(Bin(N,q),m)
#   pay path    (prob b = 0.05): they pay and may share a commission link;
#               they send 10 invitations, each accepted with prob 0.10
#   leave       (the rest): no offspring
# Willingness to take the share path falls with the number demanded:
#   s(m) = s0 exp(-(m - 1) / 3),  s0 = the share rate when m = 1.
# Every accepted invitee is a new user who starts the same funnel, so the
# users form a Galton-Watson branching process with mean offspring
#   K = s(m) E[min(Bin(N, q), m)] + b 10 0.10.
# K > 1 is the supercritical regime. Because a sharer stops at m joiners,
# K can never exceed s(m) m + 0.05, whatever q is. For three values of s0
# the program tabulates K at q = 0.15, that ceiling, and the acceptance
# rate q* at which K = 1.
import math

N, B, N2, Q2 = 20, 0.05, 10, 0.10

def s_of(m, s0):
    return s0 * math.exp(-(m - 1) / 3)

def mean_min(n, q, m):
    return sum(min(k, m) * math.comb(n, k) * q ** k * (1 - q) ** (n - k)
               for k in range(n + 1))

def k_value(m, q, s0):
    return s_of(m, s0) * mean_min(N, q, m) + B * N2 * Q2

def q_star(m, s0):
    lo, hi = 0.0, 1.0
    if k_value(m, hi, s0) < 1:
        return None
    for _ in range(60):
        mid = (lo + hi) / 2
        if k_value(m, mid, s0) < 1:
            lo = mid
        else:
            hi = mid
    return hi

if __name__ == "__main__":
    for s0 in (0.30, 0.50, 0.80):
        print("   s0 = {:.2f}   m   K at q = 0.15   ceiling   q* for K = 1"
              .format(s0))
        for m in range(1, 7):
            qs = q_star(m, s0)
            print("               {}       {:5.3f}        {:5.3f}       {}"
                  .format(m, k_value(m, 0.15, s0),
                          s_of(m, s0) * m + B * N2 * Q2,
                          "never" if qs is None else "{:.3f}".format(qs)))
    print("\n   pay channel alone contributes {:.3f}".format(B * N2 * Q2))
    print("\nReading: a sharer brings at most m joiners, so the share rate")
    print("caps K. With 30 % or 50 % of users willing to share, no unlock")
    print("threshold and no acceptance rate reaches K = 1. Only when most")
    print("users share does K cross 1, at a moderate threshold (m = 2 to 3)")
    print("and an acceptance rate that the table states exactly.")

Single source and citation

Fan, Y. (2026). Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization (Version 1.0.0), Chapter 1: The Branching Process of "Invite to Unlock". 5D Library. https://doi.org/10.5281/zenodo.24090174

DOI: 10.5281/zenodo.24090174 · Read the monograph · 5DL-B-063 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026063,
  author    = {Fan, Yafu},
  title     = {Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090174},
  url       = {https://doi.org/10.5281/zenodo.24090174}
}

Other chapter answers in this book