3 ms·
Ben Tilly (@btilly here) and Andrew Odlyzko's "A refutation of Metcalfe's Law and a better estimate for the value of networks and network interconnections" give
by dredmorbius 6y ago
Ben Tilly (@btilly here) and Andrew Odlyzko's "A refutation of Metcalfe's Law and a better estimate for the value of networks and network interconnections" gives a better estimator, n * log(n). But otherwise yes.
http://www.dtc.umn.edu/~odlyzko/doc/metcalfe.pdf http://www.dtc.umn.edu/~odlyzko/doc/metcalfe.pdf
My view is that there is also a costant-across-n (thouggh variable with t) cost function, so:
v = n * log(n) - k[t](n)
Where cost exceeds value, growth stops.
Networks grow until log(n) = k[t](n)
n == members
t == time