关于「分销网络的重尾产出与普赖斯定律」,《分销幂律、网红组合与分佣边界》给出的定量结论是什么?

结论:第一章说明普赖斯定律不是常数:尾指数 1.5 时,前根号 N 人的份额从一百人的 0.584 降到一万人的 0.299;把沉睡者算进分母会让集中度看起来更高。

数据口径:书中的分销员人数、销售分布、转化率、获客量、佣金比例与招募速度均为示意或合成模型;全部数据由书中程序生成;本书不是法律、财务或投资意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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
查看完整验算程序
# 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))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《分销网络幂律激活、网红矩阵组合优化与激励稳定边界》第 1 章「分销网络的重尾产出与普赖斯定律」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090229

DOI: 10.5281/zenodo.24090229 · 阅读本章所在专著 · 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}
}

本书其他章节结论