Papers
Topics
Authors
Recent
Search
2000 character limit reached

Metcalfe's Law Revisited

Published 18 Apr 2016 in cs.NI and cs.SI | (1604.05341v1)

Abstract: Rudimentary mathematical analysis of simple network models suggests bandwidth-independent saturation of network growth dynamics and hints at linear decrease in information density of the data. However it strongly confirms Metcalfe's law as a measure of network utility and suggests it can play an important role in network calculations. This paper establishes mathematical notion of network value and analyses two conflicting models of network. One, traditional model, fails to manifest Metcalfe's law. Another model, one that observes network in a wider context, both confirms Metcalfe's law and reveals its upper boundary.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.