Metcalfe's law
Metcalfe's law states that the value of a telecommunications network is proportional to the square of the number of connected users of the system (n2). First formulated in this form by George Gilder in 1993,[1] and attributed to Robert Metcalfe in regard to Ethernet, Metcalfe's law was originally presented, c. 1980, not in terms of users, but rather of "compatible communicating devices" (for example, fax machines, telephones, etc.).[2] Only more recently with the launch of the Internet did this law carry over to users and networks as its original intent was to describe Ethernet purchases and connections.[3] The law is also very much related to economics and business management, especially with competitive companies looking to merge with one another.
Contents
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 Internet.[4] Metcalfe's Law is related to the fact that the number of unique connections in a network of a number of nodes (n) can be expressed mathematically as the triangular number n(n − 1)/2, which is proportional to n2 asymptotically (that is, an element of O(n2)).
The law has often been illustrated using the example of fax machines: a single fax machine 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.[5] Likewise, in social networks, the greater number of users with the service, the more valuable the service becomes to the community.
Limitations
In addition to the difficulty of quantifying the "value" of a network, the mathematical justification for Metcalfe's law measures only the potential number of contacts, i.e., the technological side of a network. However the social utility of a network depends upon the number of nodes in contact. If there are language barriers or other reasons why large parts of a network are not in contact with other parts then the effect may be smaller.
Furthermore, Metcalfe’s law assumes that the value of each node n is of equal benefit. If this is not the case, for example because the one fax machines serves 50 workers, the second 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 using (n × log n) proportionality rather than n2 proportionality.[6] Reed and 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.[7]
Validate with actual data
Despite many arguments about Metcalfe' law, for 30 years no evidence based on real data was available for or against it. The situation was changed in late 2013, when Metcalfe himself used Facebook's data over the past 10 years to show a good fit for Metcalfe's law (the model is n2 ).[8] Then in 2015, Zhang, Liu and Xu extend Metcalfe's results by utilizing the actual data of Tencent (China's largest social network company) and Facebook. Their work show that: Metcalfe's law is not only valid for Facebook which in a developed country serving worldwide users, but also valid for Tencent which in a developing country mostly serving Chinese users.[9]
See also
- Simplex
- List of eponymous laws
- The generalized network effect of microeconomics.
- Pareto Principle
- Reed's law
- Sarnoff's law
- Beckstrom's Law
- Social media
- Big O notation
- Netoid function
References
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
Additional reading
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found..
- Lua error in package.lua at line 80: module 'strict' not found.
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."
