Metcalfe's law

Metcalfe's law states that the financial value or influence of a telecommunications network is proportional to the square of the number of connected users of the system (²). The law is named after Robert Metcalfe and was first proposed in 1980, albeit not in terms of users, but rather of "compatible communicating devices" (e.g., fax machines, telephones). It later became associated with users on the Ethernet after a September 1993 ''Forbes'' article by George Gilder.

Network effects

Metcalfe's law characterizes many of the network effects of communication technologies and networks such as the Internet, social networking and the World Wide Web. Former Chairman of the U.S. Federal Communications Commission Reed Hundt said that this law gives the most understanding to the workings of the present-day Internet. Mathematically, Metcalfe's Law shows that the number of unique possible connections in an $n$-node connection can be expressed as the triangular number $n(n-1)/2$, which is asymptotically proportional to $n^2$.

The law has often been illustrated using the example of fax machines: a single fax machine on its own is useless, but the value of every fax machine increases with the total number of fax machines in the network, because the total number of people with whom each user may send and receive documents increases. This is common illustration to explain network effect. Thus, in any social network, the greater the number of users with the service, the more valuable the service becomes to the community.

History and derivation

Metcalfe's law was conceived in 1983 in a presentation to the 3Com sales force. It stated would be proportional to the total number of possible connections, or approximately -squared.

The original incarnation was careful to delineate between a linear cost (), non-linear growth(²) and a non-constant proportionality factor affinity (). The break-even point point where costs are recouped is given by:$C \times n=A\times n(n-1)/2$At some size, the right-hand side of the equation , value, exceeds the cost, and describes the relationship between size and net value added. For large , net network value is then:$\Pi=n(A \times (n-1)/2 - C)$Metcalfe properly dimensioned as "value per user". Affinity is also a function of network size, and Metcalfe correctly asserted that must decline as grows large. In a 2006 interview, Metcalfe stated:

Growth of

Network size, and hence value, does not grow unbounded but is constrained by practical limitations such as infrastructure, access to technology, and bounded rationality such as Dunbar's number. It is almost always the case that user growth reaches a saturation point. With technologies, substitutes, competitors and technical obsolescence constrain growth of . Growth of n is typically assumed to follow a sigmoid function such as a logistic curve or Gompertz curve.

Density

''A'' is also governed by the connectivity or ''density'' of the network topology. In an undirected network, every ''edge'' connects two nodes such that there are 2''m'' nodes per edge. The proportion of nodes in actual contact are given by $c=2m / n$.

The maximum possible number of edges in a simple network (i.e. one with no multi-edges or self-edges) is $\binom=n(n-1)/2$.
Therefore the density ''ρ'' of a network is the faction of those edges that are actually present is:

which for large networks is approximated by $\rho=c/n$.

Limitations

Metcalfe's law assumes that the value of each node $n$ is of equal benefit. If this is not the case, for example because one fax machine serves 60 workers in a company, the second fax machine serves half of that, the third one third, and so on, then the relative value of an additional connection decreases. Likewise, in social networks, if users that join later use the network less than early adopters, then the benefit of each additional user may lessen, making the overall network less efficient if costs per users are fixed.

Modified models

Within the context of social networks, many, including Metcalfe himself, have proposed modified models in which the value of the network grows as $n \log n$ rather than $n^2$. Reed and Andrew Odlyzko have sought out possible relationships to Metcalfe's Law in terms of describing the relationship of a network and one can read about how those are related. Tongia and Wilson also examine the related question of the costs to those excluded.

Validation in data

For more than 30 years, there was little concrete evidence in support of the law. Finally, in July 2013, Dutch researchers analyzed European Internet-usage patterns over a long-enough time and found $n^2$ proportionality for small values of $n$ and $n \log n$ proportionality for large values of $n$. A few months later, Metcalfe himself provided further proof by using Facebook's data over the past 10 years to show a good fit for Metcalfe's law.

In 2015, Zhang, Liu, and Xu parameterized the Metcalfe function in data from Tencent and Facebook. Their work showed that Metcalfe's law held for both, despite differences in audience between the two sites (Facebook serving a worldwide audience and Tencent serving only Chinese users). The functions for the two sites were $V_\text=7.39\times10^\times n^2$ and $V_\text=5.70\times 10^\times n^$ respectively.
One of the earliest mentions of the Metcalfe Law in the context of Bitcoin was by a Reddit post by Santostasi in 2014. He compared the observed generalized Metcalfe behavior for Bitcoin to the Zipf's Law and the theoretical Metcalfe result.
The Metcalfe's Law is a critical component of Santostasi's Bitcoin Power Law Theory.
In a working paper, Peterson linked time-value-of-money concepts to Metcalfe value using Bitcoin and Facebook as numerical examples of the proof, and in 2018 applied Metcalfe's law to Bitcoin, showing that over 70% of variance in Bitcoin value was explained by applying Metcalfe's law to increases in Bitcoin network size.

In a 2024 interview, mathematician Terence Tao emphasized the importance of universality and networking within the mathematics community, for which he cited the Metcalfe's Law. Tao believes that a larger audience leads to more connections, which ultimately results in positive developments within the community. For this, he cited Metcalfe's law to support this perspective. Tao further stated, "my whole career experience has been sort of the more connections equals just better stuff happening".

See also

* Anti-rival good
* Beckstrom's law
* List of eponymous laws
* Matching (graph theory)
* Matthew effect
* Pareto principle
* Reed's law
* Sarnoff's law

References

Further reading

*

External links

A Group Is Its Own Worst Enemy
Clay Shirky's keynote speech on Social Software at the O'Reilly Emerging Technology conference, Santa Clara, April 24, 2003. The fourth of his "Four Things to Design For" is: "And, finally, you have to find a way to spare the group from scale. Scale alone kills conversations, because conversations require dense two-way conversations. In conversational contexts, Metcalfe's law is a drag."

{{DEFAULTSORT:Metcalfe's Law
Computer architecture statements
Eponymous laws of economics
Information theory
Network theory