Metcalfe's Law after 40 Years of Ethernet¶
Metcalfe, B. (2013). Metcalfe's Law after 40 Years of Ethernet. Computer, 46(12), 26-31.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Common-Medium Intermediation
- The argument is combinatorial: the count of pairwise translations grows as N times N-minus-one over two, while the count of one-to-medium adaptations grows as N.
This sourceStates the network-value law derived from the N(N−1)/2 possible pairwise connections versus N adopters of a shared standard — the combinatorial basis of the hub collapse and the network effect.
- The argument is combinatorial: the count of pairwise translations grows as N times N-minus-one over two, while the count of one-to-medium adaptations grows as N.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:44a9b6418013 · see in the full table