Network Economics & Tech Valuation
Metcalfe vs Odlyzko-Tilly Network Value & Critical Mass
Compare Metcalfe pair count N*(N - 1)/2 against Odlyzko-Tilly Zipf network value N * LN(N) and solve Rohlfs’s (1974) critical-mass tipping penetration f_crit*.
Avoid quadratic Metcalfe overvaluation and solve exact Rohlfs critical-mass tipping!
Metcalfe’s Law values an N-user communication network proportionally to all N * (N - 1) / 2 pairs — falsely assuming every user values their 1,000th contact identically to their closest colleague! Andrew Odlyzko and Benjamin Tilly (2005) showed that when contact value decays by Zipf’s rank law (1, 1/2, 1/3, ..., 1/(N-1) ~ LN(N)), per-user value grows as LN(N) and total network value grows as N * LN(N)! Meanwhile, Jeffrey Rohlfs (1974) proved that when users have uniform standalone value v_i in [0, v_max] scaled by active penetration fraction f in [0, 1] at subscription price P < v_max / 4, marginal indifference f * v_max * (1 - f) = P creates an unstable Critical-Mass Tipping Point f_crit* = 0.5 * (1 - SQRT(1 - 4 * P / v_max)) and a stable High-Adoption Equilibrium f_high* = 0.5 * (1 + SQRT(1 - 4 * P / v_max))!
Verify on N = 1,000 users (B2), max value v_max = 100 (B3), and price P = 16 (B4): Metcalfe pairs equal 499,500 whereas Odlyzko-Tilly Zipf value is 1,000 * LN(1,000) = 6,907.7553; discriminant 1 - 64 / 100 = 0.36 = 0.60^2 yields exact Critical Mass f_crit* = (1 - 0.60) / 2 = 0.2000 (20.00% — below 20% adoption the network unravels to 0!) and stable penetration f_high* = (1 + 0.60) / 2 = 0.8000 (80.00%)!
| Network Metric (N=1,000, v_max=100, P=16) | Formula | Verified Output |
|---|---|---|
| Metcalfe Unweighted Pair Count | N * (N - 1) / 2 | 499,500.00 |
| Odlyzko-Tilly Zipf Network Index | N * LN(N) | 6,907.7553 |
| Rohlfs Critical-Mass Hurdle (f_crit*) | 0.5 * (1 - SQRT(1 - 4*P / v_max)) | 0.2000 (20.00% Tipping Point) |
| Stable High-Adoption Share (f_high*) | 0.5 * (1 + SQRT(1 - 4*P / v_max)) | 0.8000 (80.00% Market Share) |
Odlyzko-Tilly Zipf-Weighted Network Value Index N * LN(N) Formula
Validate network size N >= 2 before evaluating N * LN(N).
=IF(B2 < 2, "Require N >= 2", ROUND(B2 * LN(B2), 4))Rohlfs Critical-Mass Tipping Fraction f_crit* Formula
Notice the knife-edge price ceiling P <= v_max / 4: if subscription price P exceeds 0.25 * v_max, f * (1 - f) <= 0.25 can NEVER cover P / v_max and the network collapses to zero adoption from ANY starting base!
=LET(v_mx, B3, px_s, B4, IF(OR(v_mx <= 0, px_s < 0), "Invalid Network Input", IF(4 * px_s > v_mx, "Network Collapse (Price > v_max / 4)", ROUND(0.5 * (1 - SQRT(1 - (4 * px_s) / v_mx)), 4))))Try the example
Use the original values or change them to test your understanding.