关于「网络效应:n²、n log n,以及用户越多越糟的那一点」,《订阅制与 AI 的单位经济学》给出的定量结论是什么?

结论:第六章比较梅特卡夫的 n² 与 Odlyzko-Tilly 的 n ln n(十倍用户分别带来 100.0 倍与 11.60 倍价值),加入拥堵后价值先升后降,并说明当变现能力每年增长 50% 时,收入对用户的拟合会给出 1.91 的指数而「证实」错误的定律。

数据口径:本书不是投资或财务建议;全部数据为程序生成的合成数据。 第七章与《史记·货殖列传》「贪贾三之,廉贾五之」与计然「无息币」并读,把利润率与周转率的读法明确标为诠释。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 100.0, 11.60

A. Value multiple when the network grows tenfold
   from n        Metcalfe   Zipf (n ln n)
         100    x  100.9    x 14.46
      10,000    x  100.0    x 12.35
   1,000,000    x  100.0    x 11.60
B. Interconnecting networks of 1,000,000 and 100,000 users: gain in value
   law          larger network's   smaller network's   ratio
                gain               gain                small/large
   Metcalfe     50,000,000,000     50,000,000,000        1.00
   Zipf                 95,310            239,790        2.52
Reading: under Metcalfe, tenfold users means a hundredfold value and both
sides gain equally from joining. Under the Zipf law, tenfold users means a
little over tenfold value, and the smaller network gains about two and a
half times as much as the larger one - consistent with large networks'
reluctance to interconnect on equal terms.
查看完整验算程序
# Chapter 6. How network value grows with the number of users n.
#   Metcalfe:        every pair of users is worth the same -> V ~ n (n - 1) /
#   2 ~ n^2 Odlyzko-Tilly:   a user values her k-th most valuable contact at
#   1/k (Zipf), so each
#                    user is worth H(n-1) = 1 + 1/2 + ... + 1/(n-1) ~ ln n ->
#                    V ~ n ln n
# A. Ratio of value when the network grows tenfold.
# B. Two networks of sizes n1 > n2 interconnect. Under each law, how much does
#    each side's value rise? (Briscoe, Odlyzko and Tilly's argument about why
#    the larger network is reluctant.)
import math

def H(m):
    if m < 1:
        return 0.0
    if m < 1000:
        return sum(1.0 / k for k in range(1, m + 1))
    return math.log(m) + 0.5772156649 + 1 / (2 * m)

def v_metcalfe(n):
    return n * (n - 1) / 2

def v_zipf(n):
    return n * H(n - 1)

if __name__ == "__main__":
    print("A. Value multiple when the network grows tenfold")
    print("   from n        Metcalfe   Zipf (n ln n)")
    for n in (100, 10000, 1000000):
        print(
            "   {:>9,}    x {:6.1f}    x {:5.2f}".format(
                n,
                v_metcalfe(10 * n) / v_metcalfe(n),
                v_zipf(10 * n) / v_zipf(n),
            )
        )
    print(
        "\nB. Interconnecting networks of 1,000,000 and 100,000 users: gain"
        " in value"
    )
    print("   law          larger network's   smaller network's   ratio")
    print(
        "                gain               gain                small/large"
    )
    n1, n2 = 1000000, 100000
    # each side's users gain n_other pairs / 2
    g1m = n1 * n2 / 2.0
    g2m = n1 * n2 / 2.0
    g1z = n1 * (H(n1 + n2 - 1) - H(n1 - 1))
    g2z = n2 * (H(n1 + n2 - 1) - H(n2 - 1))
    print(
        "   Metcalfe     {:14,.0f}     {:14,.0f}      {:6.2f}".format(
            g1m, g2m, g2m / g1m
        )
    )
    print(
        "   Zipf         {:14,.0f}     {:14,.0f}      {:6.2f}".format(
            g1z, g2z, g2z / g1z
        )
    )
    print("\nReading: under Metcalfe, tenfold users means"
          " a hundredfold value and both")
    print("sides gain equally from joining. Under the"
          " Zipf law, tenfold users means a")
    print("little over tenfold value, and the smaller"
          " network gains about two and a")
    print("half times as much as the larger one -"
          " consistent with large networks'")
    print("reluctance to interconnect on equal terms.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《订阅制单位经济学、净收入留存与人工智能推理标度律》第 6 章「网络效应:n²、n log n,以及用户越多越糟的那一点」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090164

DOI: 10.5281/zenodo.24090164 · 阅读本章所在专著 · 5DL-B-058 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026058,
  author    = {Fan, Yafu},
  title     = {Subscription Unit Economics, Net Revenue Retention and AI Inference Scaling Laws},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090164},
  url       = {https://doi.org/10.5281/zenodo.24090164}
}

本书其他章节结论