3 ms·
Although he made it up, there's an argument that the value goes up more than linearly. But as the network grows, every node doesn't necessarily need to talk to
by not2b 4y ago
Although he made it up, there's an argument that the value goes up more than linearly. But as the network grows, every node doesn't necessarily need to talk to every other node except in rare circumstances, or they can reach each other through an intermediate point. So maybe O(n log n) would be closer.
- hinkley 4y agoI recall seeing an article a number of years ago that argued just that. That the network effect is nlogn. Still enough to help explain why large networks grow larger, but it also means that overcoming the incumbent is not the insurmountable wall it may seem to be. You may only need to work twice as hard to catch up, rather than orders of magnitude harder.