关于「多层分佣的几何与金字塔的饱和」,《分销幂律、网红组合与分佣边界》给出的定量结论是什么?

结论:第五章计算多层分佣的几何:每人招五人的十二层满树需要 305,175,781 人,有限市场饱和后 0.724 的成员净亏损,并说明马来西亚第 500 号法令与美国联邦贸易委员会指引的界线。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 305175781

blevels for RM 3,000people belowoverride (RM)
2 7 254 1,824 not reached
353635,229
531554,050
full tree of depth 12
bmembersshare above purchaseshare with no recruit
28,1910.2500.500
3797,1610.1110.667
5305,175,7810.2000.800
查看完整验算程序
# Chapter 5. p09: The geometry of multi-level pay. A plan pays 50% of
# volume in all, spread over seven levels: 20, 10, 8, 5, 4, 2 and 1
# percent. Each member moves RM 300 a month, RM 200 of it the purchase
# needed to stay qualified. If every member brings in b recruits, a
# member with l full levels below has b + b^2 + ... + b^l people under
# her. How many does she need for RM 3,000 a month of override, and in
# a finished network (a full b-ary tree, depth 12) what share of members
# earn more in override than their own required purchase?
RATES = (0.20, 0.10, 0.08, 0.05, 0.04, 0.02, 0.01)
VOLUME, BUY = 300.0, 200.0

def override(b, levels):
    return sum(r * VOLUME * b ** (i + 1)
               for i, r in enumerate(RATES[:levels]))

if __name__ == "__main__":
    print("   b   levels for RM 3,000   people below   override (RM)")
    for b in (2, 3, 5):
        for lv in range(1, 8):
            if override(b, lv) >= 3000 or lv == 7:
                people = sum(b ** k for k in range(1, lv + 1))
                note = "" if override(b, lv) >= 3000 else "  not reached"
                print("   {}   {:19d}   {:12,d}   {:13,.0f}{}".format(
                    b, lv, people, override(b, lv), note))
                break
    print("   full tree of depth 12")
    print("   b   members        share above purchase   share with no"
          " recruit")
    for b in (2, 3, 5):
        depth = 12
        members = sum(b ** d for d in range(depth + 1))
        above = 0
        for d in range(depth + 1):
            if override(b, min(7, depth - d)) > BUY:
                above += b ** d
        leaves = b ** depth
        print("   {}   {:13,d}  {:21.3f}   {:20.3f}".format(
            b, members, above / members, leaves / members))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《分销网络幂律激活、网红矩阵组合优化与激励稳定边界》第 5 章「多层分佣的几何与金字塔的饱和」(版本 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}
}

本书其他章节结论