5D Library › Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization · 中文

Chapter 1. The Branching Process of “Invite to Unlock”

Two channels

Picture the funnel of a reading website. A new user first sees a free reading, then faces three choices: invite friends, and once mm have joined, unlock the full result for free (the share channel); pay directly and receive a referral link that earns commission (the pay channel); or leave. Every friend who accepts is a new user who goes through the same funnel again.

This is exactly a Galton-Watson branching process: each “individual” independently produces a random number of “offspring”, who produce offspring in turn (Harris 1963; Athreya and Ney 1972). The K of the slogan is the average number of new users each user brings, the mean of the offspring distribution. The basic theorem of branching processes says that for K ≤ 1 a cascade started by one seed dies out with probability 1, and for K > 1 it grows without limit with positive probability.

Calculation

K for two channels. Let s(m)s(m) be the share rate (the share of users willing to bring people in to unlock, which falls with the number mm required), qq the chance that an invitation is accepted, and let a sharer send at most N=20N = 20 invitations, stopping once mm have joined. Let bb be the pay rate; a payer sends 10 referral links, each accepted with probability 0.10. Then K=s(m)E[min⁡(Bin(N,q),m)]+b×10×0.10.K = s(m)\, \mathrm{E}\big[\min(\mathrm{Bin}(N, q),\, m)\big] + b \times 10 \times 0.10 . Because a sharer stops at mm, the first term can never exceed s(m)ms(m)\,m: however high qq is, the share rate caps K.

The first program takes s(m)=s0e−(m−1)/3s(m) = s_0\, e^{-(m-1)/3} and, for three values of s0s_0, computes K, its ceiling, and the acceptance rate q*q^{*} at which K is exactly 1.

Calculation

# 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.")
#    s0 = 0.30   m   K at q = 0.15   ceiling   q* for K = 1
#                1       0.338        0.350       never
#                2       0.434        0.480       never
#                3       0.417        0.512       never
#                4       0.352        0.491       never
#                5       0.280        0.445       never
#                6       0.218        0.390       never
#    s0 = 0.50   m   K at q = 0.15   ceiling   q* for K = 1
#                1       0.531        0.550       never
#                2       0.690        0.767       never
#                3       0.661        0.820       never
#                4       0.553        0.786       never
#                5       0.433        0.709       never
#                6       0.331        0.617       never
#    s0 = 0.80   m   K at q = 0.15   ceiling   q* for K = 1
#                1       0.819        0.850       never
#                2       1.074        1.196       0.124
#                3       1.028        1.282       0.143
#                4       0.854        1.227       0.192
#                5       0.662        1.104       0.283
#                6       0.499        0.957       never
#
#    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.

The first block already overturns the first half of the slogan. With only 30 % of users willing to share, K is at most 0.512 whatever the threshold, and no acceptance rate takes it past 1; at 50 % the ceiling is 0.820, still short. The choice of threshold has an interior optimum: the more people required, the more each sharer brings, but the fewer users are willing to share, so K is largest at m=2m = 2 or 3. Only when 80 % of users are willing to share can K pass 1 — with a threshold of 2 it needs an acceptance rate of 0.124 per invitation, with a threshold of 5 it needs 0.283. The pay channel by itself contributes 0.050.

What supercritical means

Even with K above 1, the second half of the slogan, “exponential explosion”, holds only for some seeds. The second program simulates 20,000 cascades from single seeds at each of three values of K.

Calculation

# Chapter 1. What a supercritical K does - and does not - promise.
# The funnel of p01 with s0 = 0.80 and unlock threshold m = 2. The
# invitation acceptance rate q is tuned so that K = 0.8, 1.0 and 1.15
# (at m = 2 no acceptance rate gives more than 1.196, the ceiling of p01).
# Offspring distribution: with prob s(2) the user brings min(Bin(20, q), 2),
# with prob 0.05 Bin(10, 0.10), otherwise 0. The extinction probability is
# the smallest root of eta = G(eta), G the offspring generating function
# (found by iterating from 0). 20,000 cascades, each started by one seed
# user and stopped at 10,000 users, give the size distribution.
import math
import random

S, B = 0.80 * math.exp(-1 / 3), 0.05

def dist(q):
    p = [0.0] * 11
    p[0] += 1 - S - B
    for k in range(21):
        pk = math.comb(20, k) * q ** k * (1 - q) ** (20 - k)
        p[min(k, 2)] += S * pk
    for k in range(11):
        p[k] += B * math.comb(10, k) * 0.1 ** k * 0.9 ** (10 - k)
    return p

def mean(p):
    return sum(k * v for k, v in enumerate(p))

def q_for(k_target):
    lo, hi = 0.0, 1.0
    for _ in range(60):
        mid = (lo + hi) / 2
        lo, hi = (mid, hi) if mean(dist(mid)) < k_target else (lo, mid)
    return hi

def extinction(p):
    eta = 0.0
    for _ in range(100000):
        eta = sum(v * eta ** k for k, v in enumerate(p))
    return eta

def cascade(p, rng, cap=10000):
    cum, acc = [], 0.0
    for v in p:
        acc += v
        cum.append(acc)
    total = alive = 1
    while alive and total < cap:
        u = rng.random()
        kids = next(i for i, c in enumerate(cum) if u <= c)
        alive += kids - 1
        total += kids
    return min(total, cap)

if __name__ == "__main__":
    rng = random.Random(63002)
    print("   K     q      dies out   reaches 1,000   median   mean size")
    for kt in (0.8, 1.0, 1.15):
        q = q_for(kt)
        p = dist(q)
        sizes = sorted(cascade(p, rng) for _ in range(20000))
        big = sum(x >= 1000 for x in sizes) / len(sizes)
        print("   {:4.2f}  {:5.3f}    {:5.3f}       {:5.3f}"
              "         {:4d}     {:7.1f}".format(
                  kt, q, extinction(p), big, sizes[len(sizes) // 2],
                  sum(sizes) / len(sizes)))
    print("\n   (subcritical theory: mean size 1 / (1 - K) = {:.1f}"
          " at K = 0.8)".format(1 / (1 - 0.8)))
    print("\nReading: even at K = 1.15 most single seeds die out within a")
    print("few generations; a supercritical K promises explosion only for")
    print("the minority of seeds that survive the first steps. At K = 1 the")
    print("mean is large but the median cascade is a handful of users.")
#    K     q      dies out   reaches 1,000   median   mean size
#    0.80  0.081    1.000       0.000            1         5.0
#    1.00  0.124    1.000       0.028            3       173.8
#    1.15  0.200    0.729       0.273            3      2736.9
#
#    (subcritical theory: mean size 1 / (1 - K) = 5.0 at K = 0.8)
#
# Reading: even at K = 1.15 most single seeds die out within a
# few generations; a supercritical K promises explosion only for
# the minority of seeds that survive the first steps. At K = 1 the
# mean is large but the median cascade is a handful of users.

At K = 0.80 every cascade dies out, with mean size 5.0, exactly the theoretical 1/(1−K)1/(1-K). At K = 1.00 the mean cascade is large (173.8), but the median is only 3 users: the mean is carried by a very few huge cascades. At K = 1.15, 0.729 of seeds still die out — this is the extinction probability of the branching process, the smallest root of η=G(η)\eta = G(\eta) — and only 0.273 of seeds grow beyond 1,000 users.

Distribution of cascade sizes: the share of seeds reaching at least a given size (log-log scale). Near K = 1.00 the size distribution is heavy-tailed; at K = 1.15 about a quarter of seeds break through the cap and the rest die out within a few generations.

Evidence

Real cascades are mostly tiny. Studies of billions of online diffusion events found that the great majority of sharing cascades stop within the first step, that large “viral” spreads are extremely rare, and that large events often come mainly from one broadcast-like burst of exposure rather than from generation after generation of person-to-person spread (Goel et al. 2012, 2016). An early study of a referral marketing network likewise found that referral chains are usually short and that each referral brings few purchases (Leskovec et al. 2007).

Hypothesis · not established

The author’s hypothesis (not established): in a real share-to-unlock funnel the K measured directly along referral chains is below 1, and the site’s growth comes mainly from a few large seeds (advertising or account broadcasts), not from generation after generation of referral. What would show it to be wrong: a generation-by-generation K, measured from complete referral logs, significantly above 1 in several independent periods, with growth coming mainly from users of the third generation and beyond.

Summary

Written as a branching process, “invite to unlock + pay and earn commission” has a K equal to the share rate times the average number each sharer brings, plus the pay channel’s contribution; because a sharer stops at the threshold, the share rate caps K. When the share rate is not high, no threshold or acceptance rate takes K past 1, and the threshold has an interior optimum. Even with K above 1, most single seeds still die out: at K = 1.15 the extinction probability is 0.729, and explosion belongs only to the few seeds that survive the first generations.

References

Athreya, Krishna B., and Peter E. Ney. 1972. Branching Processes. Springer.
Goel, Sharad, Ashton Anderson, Jake Hofman, and Duncan J. Watts. 2016. “The Structural Virality of Online Diffusion.” Management Science 62 (1): 180–96.
Goel, Sharad, Duncan J. Watts, and Daniel G. Goldstein. 2012. “The Structure of Online Diffusion Networks.” Proceedings of the 13th ACM Conference on Electronic Commerce, 623–38.
Harris, Theodore E. 1963. The Theory of Branching Processes. Springer.
Leskovec, Jure, Lada A. Adamic, and Bernardo A. Huberman. 2007. “The Dynamics of Viral Marketing.” ACM Transactions on the Web 1 (1): 5.

Fan, Y. (2026). Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization: Galton-Watson Referral Thresholds, Share-to-Unlock Incentives and Second-Degree Price Discrimination [超临界病毒级联、信息缺口风险率与多层付费墙优化] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090174 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).