5D Library › Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels · 中文
Chapter 5. From Views to Cash: Lags, Heavy Tails and Linked Bans
A funnel with lags
Views are not cash. Between a view and a settled payment lie a profile visit, a message, a purchase and a platform settlement, each with its own losses and delays. The program follows an account that posts daily: daily views are lognormal with median 4,000 and log standard deviation 1.0 (most days quiet, a few explosive); 2% of viewers open the profile, 20% of those send a message, 15% of those buy the RM 49 entry product 0 to 3 days later; 15% of buyers buy the RM 298 programme 14 days later; the payment platform settles 7 days after payment. Costs are RM 3,000 to set up on day 0 and RM 120 a day.
Calculation
# Chapter 5. p09: From views to cash: a funnel with lags and heavy tails.
# One account posts daily. Views per day are lognormal with median
# 4,000 and log-sd 1.0 (most days are quiet, a few go far). Funnel:
# 2 % of viewers open the profile; 20 % of those send a message;
# 15 % of those buy the RM 49 entry product, paid 0 to 3 days later;
# 15 % of buyers buy the RM 298 programme 14 days after entry.
# The payment platform settles each sale 7 days after it is paid.
# Costs: RM 3,000 set-up on day 0, then RM 120 per day. Counts are
# drawn as Poisson. 2,000 simulated 90-day runs, fixed seed.
import math
import random
def poisson(rng, lam):
if lam > 50:
return max(0, int(round(rng.gauss(lam, math.sqrt(lam)))))
k, p, l = 0, 1.0, math.exp(-lam)
while True:
p *= rng.random()
if p < l:
return k
k += 1
def run(rng, days=90):
cash = [0.0] * (days + 40)
cash[0] -= 3000
for d in range(days):
cash[d] -= 120
views = 4000 * math.exp(rng.gauss(0, 1.0))
msgs = poisson(rng, views * 0.02 * 0.20)
for _ in range(poisson(rng, msgs * 0.15)):
pay = d + rng.randint(0, 3)
cash[pay + 7] += 49
if rng.random() < 0.15:
cash[pay + 14 + 7] += 298
run_cash, out, be = 0.0, [], None
for d in range(days):
run_cash += cash[d]
out.append(run_cash)
if be is None and d > 0 and run_cash >= 0:
be = d
return out, be
if __name__ == "__main__":
rng = random.Random(49)
runs = [run(rng) for _ in range(2000)]
for day in (14, 30, 60, 89):
vals = sorted(r[0][day] for r in runs)
neg = sum(1 for v in vals if v < 0) / len(vals)
print(" day {:2d}: median cash RM {:9,.0f} P(cash < 0) {:.3f}"
.format(day, vals[len(vals) // 2], neg))
bes = sorted(r[1] if r[1] is not None else 999 for r in runs)
print(" break-even day: median {}, 10th pct {}, 90th pct {}".format(
bes[1000], bes[200], bes[1800]))
lam = 4000 * math.exp(0.5) * 0.02 * 0.20 * 0.15
print(" mean buyers per day {:.2f}; at the median day {:.2f}".format(
lam, 4000 * 0.02 * 0.20 * 0.15))
print("\nReading: settlements start only after a week, and the set-up")
print("cost is recovered around day 35, between day 26 and day 48 in")
print("eight runs out of ten. Heavy-tailed views make the mean")
print("day much better than the typical day, so plans built on an")
print("average day overstate what most months will bring.")
# day 14: median cash RM -3,673 P(cash < 0) 0.999
# day 30: median cash RM -1,081 P(cash < 0) 0.719
# day 60: median cash RM 6,342 P(cash < 0) 0.012
# day 89: median cash RM 13,686 P(cash < 0) 0.000
# break-even day: median 35, 10th pct 26, 90th pct 48
# mean buyers per day 3.96; at the median day 2.40
#
# Reading: settlements start only after a week, and the set-up
# cost is recovered around day 35, between day 26 and day 48 in
# eight runs out of ten. Heavy-tailed views make the mean
# day much better than the typical day, so plans built on an
# average day overstate what most months will bring.On day 14 the median cash position is a deficit of RM 3,673 and almost every run is negative; on day 30 the median is still a deficit of RM 1,081, with 0.719 of runs negative; by day 60 the median is a surplus of RM 6,342 and only 0.012 of runs are negative; on day 89 the median is RM 13,686. The median break-even day is day 35, and in eight runs out of ten it falls between day 26 and day 48. Because views are heavy-tailed, the mean day has 3.96 buyers while the median day has only 2.40: planning on an “average day” overstates what most months bring.
Note
Practical consequence. The cash reserve should cover the bad case of the break-even day, day 48 in this model; settlement cycles, refund windows and platform holds all push that day later. Plan months on the median, not the mean.
Account matrices and linked bans
Running several accounts is often treated as diversification. It is, only if their risks are independent. The program takes 10 accounts, each with the same marginal chance of a ban, 0.03 per month; bans can come from a common shock: in a month with a platform sweep (chance ) each linked account is banned with chance , and in other months with a lower chance that keeps the marginal rate fixed.
Calculation
# 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.")
# 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.In all four scenarios about 3 accounts are lost in a year on average (3.02 to 3.07). The difference is all in the tail: with independent accounts the chance of losing eight or more in a year is only 0.0019; with loose links through shared payment details it is 0.1006; with tight links through shared devices, 0.2353. Splitting the accounts into two unlinked clusters of five brings it down to 0.0966, still far above full independence. The chance of losing five or more also rises from 0.1625 to 0.3765. Links turn an account matrix into one large bet.
Hypothesis · not established
Testable consequence. If bans come mainly from common shocks, the ban dates of one operator’s accounts should cluster in time, more so the more devices and payment details they share. What would show this wrong: if ban dates are close to independent across accounts and unrelated to sharing, the matrix does diversify the risk.
Summary
Every step of the funnel has losses and lags, and cash passes through a deficit before it breaks even; heavy-tailed views make the average a misleading basis for plans. An account matrix diversifies only when its accounts are truly independent; shared devices or payment details make them fail together.
Fan, Y. (2026). Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels: Weibull Swipe-Away Kinetics, Multi-Stage Pool Promotion Thresholds and Traffic-to-Cashflow Conversion Bounds [短视频完播率风险函数、推荐反馈环与自动化获客漏斗] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090213 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).