#Barabási & Albert: Scale-Free Networks

The assumption that connections in a network are distributed randomly among its members was challenged by the 1999 discovery of 'scale-free' networks by László Barabási and Réka Albert. By examining systems like the World Wide Web and actor collaboration graphs, they found that a few nodes, called 'hubs,' possess a disproportionately large number of connections, while the vast majority of nodes have very few. They proposed that this structure emerges naturally through a process of growth and 'preferential attachment,' where new members prefer to link with those who are already well-connected. It was a push toward understanding how systems organize themselves through simple local rules.

#The Rich-Get-Richer Effect

Connectivity distributions for actor collaborations, the web, and power grids showing power-law scaling.

The core innovation is the concept of preferential attachment. In older models, it was assumed that new nodes link to existing ones with equal probability. Barabási and Albert argued that nodes with more connections are more likely to receive new ones. As they put it, 'The probability with which a new vertex connects to the existing vertices is not uniform; there is a higher probability that it will be linked to a vertex that already has a large number of connections.' This leads to a 'power-law' distribution where there is no 'typical' node size—hence the term 'scale-free.'