What does Completion Hazards, Feedback Loops and Funnels conclude, in numbers, about “From Views to Cash: Lags, Heavy Tails and Linked Bans”?

Answer: Chapter 5 simulates the cash flow from views to settled payments (median break-even on day 35) and shows that an account matrix sharing devices raises the chance of losing eight or more accounts in a year from 0.0019 to 0.2353.

Scope of the numbers: Marked boxes separate evidence, runnable Python programs, classical sources and 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.0019, 0.2353

   scenario               mean lost  P(5 or more)  P(8 or more)
   independent                 3.07        0.1625        0.0019
   loosely linked              3.06        0.3521        0.1006
   tightly linked              3.02        0.3765        0.2353
   two clusters of five        3.06        0.3130        0.0966
Reading: the expected number of lost accounts is the same
in every scenario, but linked accounts fail together. Shared
devices or payment details turn a matrix into one large bet:
the chance of losing eight or more rises from 0.0019 to
0.2353. Two unlinked clusters cut that to 0.0966; only truly
independent accounts restore the diversification.
Show the full program
# Chapter 5. p10: Ten accounts are not ten independent bets.
# A matrix of 10 accounts; each has the same marginal chance of a ban,
# 0.03 per month. Bans may come from a common shock: in a month with a
# platform sweep (chance s) each linked account is banned with chance
# q; otherwise with chance p0, where s q + (1 - s) p0 = 0.03.
# Scenarios: independent accounts; loosely linked (shared payment
# details); tightly linked (shared devices); and two separate clusters
# of five on different platforms, tightly linked within each. 12
# months, 40,000 runs each, fixed seed. Banned accounts stay banned.
import random

SCEN = [("independent", 0.0, 0.0),
        ("loosely linked", 0.05, 0.5),
        ("tightly linked", 0.04, 0.75)]

def months(rng, alive, s, q):
    sweep = rng.random() < s
    p0 = (0.03 - s * q) / (1 - s)
    pr = q if sweep else p0
    return [a and not (rng.random() < pr) for a in alive]

def run(rng, s, q, split=False):
    if not split:
        alive = [True] * 10
        for _ in range(12):
            alive = months(rng, alive, s, q)
        return 10 - sum(alive)
    a, b = [True] * 5, [True] * 5
    for _ in range(12):
        a = months(rng, a, s, q)
        b = months(rng, b, s, q)
    return 10 - sum(a) - sum(b)

if __name__ == "__main__":
    rng = random.Random(10)
    n = 40000
    print("   scenario               mean lost  P(5 or more)  P(8 or more)")
    rows = [(name, s, q, False) for name, s, q in SCEN]
    rows.append(("two clusters of five", 0.04, 0.75, True))
    for name, s, q, split in rows:
        lost = [run(rng, s, q, split) for _ in range(n)]
        print("   {:22s} {:9.2f} {:13.4f} {:13.4f}".format(
            name, sum(lost) / n, sum(1 for x in lost if x >= 5) / n,
            sum(1 for x in lost if x >= 8) / n))
    print("\nReading: the expected number of lost accounts is the same")
    print("in every scenario, but linked accounts fail together. Shared")
    print("devices or payment details turn a matrix into one large bet:")
    print("the chance of losing eight or more rises from 0.0019 to")
    print("0.2353. Two unlinked clusters cut that to 0.0966; only truly")
    print("independent accounts restore the diversification.")

Single source and citation

Fan, Y. (2026). Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels (Version 1.0.0), Chapter 5: From Views to Cash: Lags, Heavy Tails and Linked Bans. 5D Library. https://doi.org/10.5281/zenodo.24090213

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

BibTeX
@book{fan2026081,
  author    = {Fan, Yafu},
  title     = {Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090213},
  url       = {https://doi.org/10.5281/zenodo.24090213}
}

Other chapter answers in this book