Metcalfe's law

Two telephones can make only one connection, five can make 10 connections, and twelve can make 66 connections.

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 (n²). 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 later with the globalization 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.

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 n² asymptotically (that is, an element of Θ(n²)).

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.

Metcalfe’s law assumes that the value of each node n is of equal benefit.^[6] 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 n² proportionality.^[7] 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.^[8]

Validation with actual data

Despite many arguments about Metcalfe' law, no real data based evidence for or against was available for more than 30 years. Only in July 2013, Dutch researchers managed to analyze European Internet usage patterns over a long enough time and found n² proportionality for small values of n and (n × log n) proportionality for large values of n.^[9] A few months later, Metcalfe himself provided further proof, as he used Facebook's data over the past 10 years to show a good fit for Metcalfe's law (the model is n² ).^[10] 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. The Metcalfe's functions of them are $V_{Tencent}=7.39*10^{-9}*n^{2}$ and $V_{Facebook}=5.70*10^{-9}*n^{2}$ respectively. ^[11]

References

↑ Carl Shapiro and Hal R. Varian (1999). Information Rules. Harvard Business Press. ISBN 0-87584-863-X.
↑ Simeon Simeonov (July 26, 2006). "Metcalfe's Law: more misunderstood than wrong?". HighContrast: Innovation & venture capital in the post-broadband era.
↑ James Hendler and Jennifer Golbeck (2008). "Metcalfe's Law, Web 2.0, and the Semantic Web" (PDF).
↑ Bob Briscoe (July 2006). "Metcalfe's Law is wrong". Retrieved 2010-07-25.
↑ R. Tongia. "The Dark Side of Metcalfe's Law: Multiple and Growing Costs of Network Exclusion" (PDF). Retrieved 2010-07-25.
↑ Andrew Odlyzko; Bob Briscoe (1 Jul 2006). "Metcalfe's Law is Wrong". IEEE Spectrum: Technology, Engineering, and Science News. Retrieved 25 November 2016.
↑ "Guest Blogger Bob Metcalfe: Metcalfe's Law Recurses Down the Long Tail of Social Networks". 18 August 2006. Retrieved 2010-06-20.
↑ Rahul Tongia and Ernest Wilson (September 2007). "The Flip Side of Metcalfe's Law: Multiple and Growing Costs of Network Exclusion". Retrieved 2013-01-15.
↑ Madureira, António; den Hartog, Frank; Bouwman, Harry; Baken, Nico (2013), "Empirical validation of Metcalfe's law: How Internet usage patterns have changed over time", Information Economics and Policy, doi:10.1016/j.infoecopol.2013.07.002
↑ Metcalfe, Bob (2013). "Metcalfe's law after 40 years of Ethernet". IEEE Computer.
↑ Zhang, Xing-Zhou; Liu, Jing-Jie; Xu, Zhi-Wei (2015). "Tencent and Facebook Data Validate Metcalfe's Law". JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY. doi:10.1007/s11390-015-1518-1.

Additional reading

Smith, David; Skelley, C. A. (Summer 2006), "Globalization Transformation" (PDF), Tennessee Business Magazine: 17–19
Briscoe, Bob; Odlyzko, Andrew; Tilly, Benjamin (July 2006), "Metcalfe's Law is Wrong", IEEE Spectrum .

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."

Computer laws

Amdahl's law Bell's law Grosch's law Gustafson's law Haitz's law Koomey's law Linus's Law Metcalfe's law Moore's law Pollack's Rule Rock's law Wirth's law

Social networks and social media

Types	City Personal Professional Sexual Value

Networks	Distributed social network (list) Enterprise social networking Mobile social network Personal knowledge networking

Services	List of social networking websites List of virtual communities with more than 1 million users List of virtual communities with more than 100 million active users

Concepts and theories	Assortative mixing Interpersonal bridge Organizational network analysis Small-world experiment Social aspects of television Social capital Social data revolution Social exchange theory Social identity theory Social network analysis Social web Structural endogamy

Models and processes	Aggregation Change detection Collaboration graph Collaborative consumption Giant Global Graph Lateral communication Social graph Social network analysis software Social networking potential Social television Structural cohesion

Economics	Collaborative finance Social commerce

Phenomena	Community recognition Complex contagion Consequential strangers Friend of a friend Friendship paradox Six degrees of separation Social invisibility Social network game Social occultation Tribe

Related topics	Researchers User profile Viral messages Virtual community

This article is issued from Wikipedia - version of the 11/25/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.