“What is really amazing about this is that these networks — that differ both in nature and in age — have over time and through many different processes converged to a somewhat similar architecture as if the same designer tried to build them,” said Barabási, who is known for introducing the concept of scale-free networks in 1999 using the World Wide Web as an example.
A scale-free network is one in which the distribution of connections to nodes follows a power law, like the 80/20 rule often used to describe distribution of wealth among a population: 20 percent of the people own 80 percent of the wealth. In a scale-free network, there are a very few nodes that have many, many connections, and many, many nodes with only a few connections. A smattering of nodes have connections that fall somewhere between, but the distribution is largely polarized with the vast majority belonging to a few nodes.
In the U.S. airline system, for instance, airports serve as nodes and direct flights between them serve as connecting links. Airline hubs have many links, while smaller airports have very few.
As a scale-free network grows, the nodes with the most connections will continue to get a larger share of new connections than will less-popular nodes. Facebook is a good example of this “preferential attachment.” The website has exponentially more links than do most of the other trillion pages on the Web. Barabási has also modeled the mechanism describing how one enormous hub can overcome another, in this case Facebook overtaking Google as the largest hub on the Web.
Read more and view the video: http://cee.mit.edu/news/releases/2011/DES4-Barabasi