What does Affiliate Power Laws, Creator Portfolios and Commission Bounds conclude, in numbers, about “Heavy-Tailed Output in Affiliate Networks and Price's Law”?

Answer: Chapter 1 shows that Price's law is not a constant: at a tail index of 1.5 the share of the top square root of N falls from 0.584 for a hundred people to 0.299 for ten thousand, and counting dormant registrants makes concentration look higher.

Scope of the numbers: Its numbers of affiliates, sales distributions, conversion rates, customer counts, commission rates and recruitment speeds are illustrative or synthetic; all data are generated by its programs; the book is not legal, financial or investment advice. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's 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.299, 0.584, 1.5

share of output from the top sqrt(N) (median of repeats)
alphaN = 100N = 1,000N = 10,000
1.10.6910.6030.545
1.50.5840.4220.299
2.00.4920.3060.189
3.00.4300.2280.119
top sqrt(N) as a share of people: 0.100 / 0.031 / 0.010
Show the full program
# Chapter 1. p01: Does the top square root of N really produce half? Price's
# law says that in a group of N producers, the top sqrt(N) produce about
# half of all output. Here output per affiliate follows a Lomax (Pareto
# type II) law with tail index alpha: x = U^(-1/alpha) - 1. For several
# alpha and N, the median share of the top sqrt(N) over repeats is shown,
# seed 87. A smaller alpha means a heavier tail (alpha <= 1: infinite mean).
import random
from math import isqrt

def lomax(rng, alpha):
    return (1.0 - rng.random()) ** (-1.0 / alpha) - 1.0

def top_share(rng, n, alpha):
    xs = sorted((lomax(rng, alpha) for _ in range(n)), reverse=True)
    k = isqrt(n)
    return sum(xs[:k]) / sum(xs)

if __name__ == "__main__":
    rng = random.Random(87)
    sizes = (100, 1000, 10000)
    print("   share of output from the top sqrt(N) (median of repeats)")
    print("   alpha    N = 100   N = 1,000   N = 10,000")
    for alpha in (1.1, 1.5, 2.0, 3.0):
        row = []
        for n in sizes:
            reps = 300 if n < 10000 else 60
            s = sorted(top_share(rng, n, alpha) for _ in range(reps))
            row.append(s[reps // 2])
        print("   {:5.1f}    {:7.3f}   {:9.3f}   {:10.3f}"
              .format(alpha, *row))
    print("   top sqrt(N) as a share of people: {:.3f} / {:.3f} / {:.3f}"
          .format(10 / 100, 31 / 1000, 100 / 10000))

Single source and citation

Fan, Y. (2026). Affiliate Network Power Laws, Influencer Portfolio Optimization and Incentive Stability Bounds (Version 1.0.0), Chapter 1: Heavy-Tailed Output in Affiliate Networks and Price's Law. 5D Library. https://doi.org/10.5281/zenodo.24090229

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

BibTeX
@book{fan2026087,
  author    = {Fan, Yafu},
  title     = {Affiliate Network Power Laws, Influencer Portfolio Optimization and Incentive Stability Bounds},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090229},
  url       = {https://doi.org/10.5281/zenodo.24090229}
}

Other chapter answers in this book