skip to content

Theorem 11 (stretched-exponential survival bound)

Apparatus §9 · rate-of-foreclosure under intermediate tail conditions

The rate-of-foreclosure refinement. Lemma 1 gives polynomial decay under bounded coefficient of variation and exponential decay under finite moment-generating function. Theorem 11 fills the gap: under Weibull-shape sub-exponential tails (Class for ), survival decays as — a stretched exponential.

Lemma 1 has two regimes: polynomial decay under bounded (unconditional, but loose) and exponential decay under finite MGF (sharp, but requires heavier tail condition). The intermediate regime — sub-exponential or stretched-exponential tails — is where most empirical engagement-interval distributions sit (Weibull, log-normal, gamma-with-shape less than one). §9 supplies the missing bound.

The stretched-exponential class. An inter-arrival distribution belongs to Class for if is finite on some interval . Class recovers the standard MGF condition. Class for captures Weibull-shape tails: may be infinite, but is finite.

The empirical-tail question. Inter-arrival times for engagement events on real platforms have been measured across multiple studies, with consistent findings: log-normal and Weibull-with-shape-less-than-one are the dominant fits, with the shape parameter typically in the 0.3-to-0.7 range. Stouffer et al. (2006) on email correspondence; Vázquez et al. (2006) on web-browsing intervals; Cheng et al. (2014) on YouTube watch-session lengths — all in the stretched-exponential class. The framework's intermediate-regime bound is therefore the regime most engagement-interval data sits in, which is what gives Theorem 11 its empirical traction.

The interpolation.

Tail classβBound on S(θ_ref; θ*)
Polynomial (bounded c_v only)O((θ_ref/δ_min)^(−2))
Stretched exponential (S_β, β < 1)βO(exp(−(θ_ref/σ)^β))
Exponential (Class L = S_1)1O(exp(−c · θ_ref/δ_min))

What the theorem authorizes the prose to claim. The foreclosure bound is empirically tight for mature platforms. For and empirically-typical Weibull shape , Theorem 11 gives — operationally zero, substantially sharper than the polynomial bound's. The framework's foreclosure claim has substantial buffer under realistic tail conditions; it sits well clear of any knife-edge bound.

The empirical hook. Fit a Weibull tail to the right portion of the empirical CCDF: . The slope gives the empirical . The framework predicts should increase toward as platforms mature — a testable prediction about engagement-interval tail-shape evolution on contemporary platforms.

Definition 9.1 (Class S_β — sub-exponential of order β)

An inter-arrival distribution belongs to Class for if there exists such that

in wordsA distribution joins class if its -stretched moments stay finite — a weaker demand than a finite ordinary moment-generating function (the case). Smaller tolerates heavier tails, and the smallest a distribution satisfies is a label for how heavy its tail is.

The class is monotone in at the level of inclusion: for . The smallest for which a distribution belongs characterizes its tail decay rate.

Theorem 11 (stretched-exponential survival bound)

Suppose the inter-arrival distribution at belongs to Class for some . Then

in wordsSurvival at the threshold decays like a stretched exponential — of minus a rate evaluated at the -power of the threshold. As sweeps from 0 to 1, this single bound interpolates between the loose polynomial bound of Lemma 1 and the sharp exponential one — and it covers the heavy-tailed regime real engagement-interval data actually occupies.

where is the Cramér transform of evaluated at .

The bound interpolates between polynomial and exponential regimes as varies in .

Proof

For , Markov on the monotone transformation :

in wordsThe proof in one move. A long pause is the same event as its stretched exponential exceeding a large value, and Markov's inequality caps the probability of any positive quantity exceeding a level by its mean divided by that level. This holds for every .

Infimum over :

in wordsSince the bound holds for every , pick the that makes it tightest. That optimization is the Cramér transform — the large-deviations rate — and it delivers the theorem's bound.

Strict positivity. The derivative at is , which is positive under structural separation . Hence .

Cross-references

  • Refines: Lemma 1 — interpolates between Lemma 1's polynomial bound (b) and exponential bound (c)
  • Required: §0 axiom (R1) and the structural-separation hypothesis
  • Empirical hook: §12 (empirical calibration) — fitting from the right tail of the CCDF
v2 apparatus rendering.