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

Chapter 2. A Finite Audience, a Clustered Network and an Acquisition Cost That Is Not Zero

The audience is finite

A branching process assumes that every new user faces an infinite crowd who have never been invited. A real audience is finite: as more and more people have been reached, invitations increasingly land on people who are already users or have already declined, and the effective K keeps falling. This is one of the oldest results in epidemiology: Kermack and McKendrick’s “final size” relation z=1−e−Kzz = 1 – e^{-Kz} gives the share of a population an epidemic finally reaches (Kermack and McKendrick 1927).

The third program runs generation by generation in an audience of one million people, and computes what the slogan’s “zero acquisition cost” actually is.

Calculation

# Chapter 2. A finite audience, and what "zero acquisition cost" hides.
# Part 1. Users can only be recruited from a finite reachable audience of
# 1,000,000 people. Generation by generation (100 seed users), each new
# user's invitations land on people already reached in proportion to the
# share already reached, so the effective number is K_eff = K x (unreached
# share). The program reports the final share reached (it solves the
# classical final-size relation z = 1 - exp(-K z) as a check), the
# generation at which K_eff falls below 1, and the peak generation size.
# Part 2. Every new user receives a free reading that costs c = 0.15 to
# generate and deliver; a 5 % share pay the price p = 9.9; a paying user
# whose referral link brought the payer earns a commission of 50 %. With
# the funnel of p02 at K = 1.15, a share 0.05 / 1.15 of joiners comes from
# paid links. Acquisition cost per paying user =
#   c / 0.05 + (share of payers from paid links) x 0.5 x 9.9.
import math

AUDIENCE, SEEDS = 1_000_000, 100

def run(k):
    reached, new, gen = SEEDS, SEEDS, 0
    below, peak = None, (0, SEEDS)
    while new >= 1:
        unreached = 1 - reached / AUDIENCE
        if below is None and k * unreached < 1:
            below = gen
        new = k * unreached * new
        reached += new
        gen += 1
        if new > peak[1]:
            peak = (gen, new)
    return reached / AUDIENCE, below, peak

def final_size(k):
    z = 0.5
    for _ in range(500):
        z = 1 - math.exp(-k * z)
    return z

if __name__ == "__main__":
    print("   K      reached   z = 1 - exp(-Kz)   K_eff < 1 from gen"
          "   peak gen (size)")
    for k in (1.15, 1.5, 2.0, 3.0):
        share, below, (pg, ps) = run(k)
        print("   {:4.2f}    {:5.3f}        {:5.3f}                {:3d}"
              "             {:3d} ({:,.0f})".format(k, share, final_size(k),
                                                    below, pg, ps))
    c, conv, price, alpha, k = 0.15, 0.05, 9.9, 0.5, 1.15
    via_link = 0.05 / k
    cac = c / conv + via_link * alpha * price
    print("\n   cost per paying user: free readings {:.2f} + commissions"
          " {:.2f} = {:.2f}".format(c / conv, via_link * alpha * price, cac))
    print("   as a share of the price 9.9: {:.3f}".format(cac / price))
    print("\nReading: in a finite audience K_eff falls below 1 once a share")
    print("1 - 1/K has been reached; a K just above 1 reaches only about a")
    print("quarter of the audience. (The generation recurrence reaches a")
    print("little more than the classical relation, which also counts")
    print("repeated invitations to the same person.) Referral growth is not")
    print("free: the free readings given to everyone who never pays are the")
    print("main acquisition cost.")
#    K      reached   z = 1 - exp(-Kz)   K_eff < 1 from gen   peak gen (size)
#    1.15    0.255        0.249                 42              42 (9,421)
#    1.50    0.618        0.583                 19              19 (72,388)
#    2.00    0.869        0.797                 12              12 (187,722)
#    3.00    0.993        0.940                  8               8 (394,652)
#
#    cost per paying user: free readings 3.00 + commissions 0.22 = 3.22
#    as a share of the price 9.9: 0.325
#
# Reading: in a finite audience K_eff falls below 1 once a share
# 1 - 1/K has been reached; a K just above 1 reaches only about a
# quarter of the audience. (The generation recurrence reaches a
# little more than the classical relation, which also counts
# repeated invitations to the same person.) Referral growth is not
# free: the free readings given to everyone who never pays are the
# main acquisition cost.

At K = 1.15 the cascade finally reaches 0.255 of the audience; at K = 1.50, 0.618; at K = 3.00 almost everyone (0.993). The generation recurrence gives slightly more than the classical relation (0.249, 0.583 …), because the classical relation also counts repeated invitations to the same person. The effective K falls below 1 once a share 1−1/K1 – 1/K of the audience has been reached, and every generation after that is smaller than the one before; at K = 1.15 this happens in generation 42, with a peak of about 9,421 new users in a single generation.

In a finite audience, the share finally reached as a function of K. Solid: the generation recurrence; dashed: the classical final-size relation.

The second part is the bill the slogan leaves out. Every new user receives a free reading that costs 0.15 to generate and deliver; at a 5 % pay rate each paying user stands behind 20 free readings given away, or 3.00; adding 0.22 of referral commission, the acquisition cost per paying user is 3.22, or 0.325 of the 9.9 price. The acquisition cost has not fallen to zero; it has moved from the advertising bill to the compute bill and the commission bill.

Friends of friends

A branching process also assumes that a user’s friends do not know each other. Real social networks are clustered: your friends are often each other’s friends. The fourth program compares three structures on a ring of twenty thousand people: fully clustered (each linked to the ten nearest on either side together), a few random links, and almost fully random.

Calculation

# Chapter 2. Friends of friends: why real networks give less than K.
# 20,000 people on a ring, each tied to the 10 nearest (5 each side);
# each tie is rewired to a random person with probability beta (beta = 0:
# tightly clustered, everyone's friends know each other; beta = 1: almost
# random). Each new user invites every friend not yet reached; each
# invitation is accepted with probability q = 0.15. On a tree a user has
# 9 friends besides the inviter, so the naive estimate is K = 9 x 0.15 =
# 1.35. From 5 seeds, 20 runs per beta: the measured mean number of new
# users per user in generations 1-3, and the final share reached.
import random

N, HALF, Q = 20000, 5, 0.15

def network(beta, rng):
    nb = [set() for _ in range(N)]
    for i in range(N):
        for d in range(1, HALF + 1):
            j = (i + d) % N
            if rng.random() < beta:
                j = rng.randrange(N)
                while j == i or j in nb[i]:
                    j = rng.randrange(N)
            nb[i].add(j)
            nb[j].add(i)
    return [list(s) for s in nb]

def spread(nb, rng):
    reached = set(rng.sample(range(N), 5))
    frontier = list(reached)
    early_kids = early_parents = 0
    gen = 0
    while frontier:
        nxt = []
        for u in frontier:
            kids = 0
            for v in nb[u]:
                if v not in reached and rng.random() < Q:
                    reached.add(v)
                    nxt.append(v)
                    kids += 1
            if 1 <= gen <= 3:
                early_kids += kids
                early_parents += 1
        frontier = nxt
        gen += 1
    return early_kids / max(early_parents, 1), len(reached) / N

if __name__ == "__main__":
    rng = random.Random(63004)
    print("   beta    early K (gens 1-3)    final share reached")
    for beta in (0.0, 0.1, 1.0):
        ks, shares = [], []
        for _ in range(20):
            k, sh = spread(network(beta, rng), rng)
            ks.append(k)
            shares.append(sh)
        print("   {:3.1f}          {:5.3f}                {:5.3f}".format(
            beta, sum(ks) / len(ks), sum(shares) / len(shares)))
    print("\n   naive tree estimate: K = 9 x 0.15 = {:.2f}".format(9 * Q))
    print("\nReading: in a clustered network a new user's friends have")
    print("mostly been invited already, so the measured K falls below 1")
    print("although the tree estimate is 1.35, and the cascade fills a local")
    print("pocket and stalls. Random ties help, but only a nearly random")
    print("network gets close to the tree estimate and a large reach.")
#    beta    early K (gens 1-3)    final share reached
#    0.0          0.934                0.003
#    0.1          1.042                0.081
#    1.0          1.402                0.570
#
#    naive tree estimate: K = 9 x 0.15 = 1.35
#
# Reading: in a clustered network a new user's friends have
# mostly been invited already, so the measured K falls below 1
# although the tree estimate is 1.35, and the cascade fills a local
# pocket and stalls. Random ties help, but only a nearly random
# network gets close to the tree estimate and a large reach.

The tree estimate gives K = 1.35. In the fully clustered network the K measured over the first generations is only 0.934: most of a new user’s friends have already been invited by the same group, and the invitations are wasted. The cascade fills one pocket and stops, finally reaching 0.003. With a tenth of the links made random, the measured K is 1.042 and the reach 0.081; only in an almost random network does the measured K (1.402) come close to the tree estimate, with a reach of 0.570.

Evidence

Clustering works in opposite directions for different kinds of spread. Studies of small-world networks showed that a few long-range links shorten distances in a network enormously (Watts and Strogatz 1998). But for “complex contagions”, which people adopt only after several exposures, clustering helps: Centola’s online experiment found that a health behaviour spread further and faster in clustered networks, because people were reinforced by several neighbours (Centola 2010). An invitation to unlock is closer to a “simple contagion” that needs one exposure, and this chapter’s model is written as one; if users join only after being urged by several friends, the conclusion may reverse.

Note

What this means for “traffic exploding exponentially by itself”. A K estimated on a tree structure is overstated in a real social network, falls over time in a finite audience, and every new user it brings has a cost. A growth plan should be written from the K measured generation by generation, the share of the audience reached, and the full acquisition cost per paying user, not extrapolated from a starting K.

Summary

In a finite audience the effective K falls with the share reached, and a cascade at K = 1.15 finally reaches only about a quarter of the audience. A clustered social network makes the measured K lower than the tree estimate: 0.934 in the fully clustered case against an estimate of 1.35, and the cascade stops in a pocket. The acquisition cost has not fallen to zero: the free readings given to people who never pay are the main cost, 0.325 of the price per paying user in the example.

References

Centola, Damon. 2010. “The Spread of Behavior in an Online Social Network Experiment.” Science 329 (5996): 1194–97.
Kermack, W. O., and A. G. McKendrick. 1927. “A Contribution to the Mathematical Theory of Epidemics.” Proceedings of the Royal Society of London A 115 (772): 700–721.
Watts, Duncan J., and Steven H. Strogatz. 1998. “Collective Dynamics of ’Small-World’ Networks.” Nature 393: 440–42.

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