The Rich Get Richer
In 1999, Albert-Laszlo Barabasi and Reka Albert discovered that many real-world networks — from the World Wide Web to biological protein interactions — share a surprising property: their degree distribution follows a power law. Unlike random networks where most nodes have roughly the same number of connections, scale-free networks are dominated by a few highly connected hubs while the vast majority of nodes have only a handful of links.
Preferential Attachment
The Barabasi-Albert model explains this through preferential attachment: when a new node joins the network, it is more likely to connect to nodes that already have many connections. The probability of connecting to node i is P(i) = k_i / sum(k_j), where k_i is the degree of node i. This 'rich-get-richer' mechanism produces a power-law degree distribution P(k) ~ k^(-gamma) with gamma approximately 3.
Robustness and Fragility
Scale-free networks display a remarkable duality. They are extremely robust against random failures — you can remove a large fraction of nodes at random and the network remains connected, because most removed nodes are low-degree. However, they are catastrophically vulnerable to targeted attacks on hub nodes. Removing just a few percent of the highest-degree nodes can shatter the network into disconnected fragments.
This property has profound implications for infrastructure design, cybersecurity, and epidemic control. Understanding which nodes are hubs — and protecting them — is essential for maintaining network integrity.
Try It Yourself
Use the simulation above to build a scale-free network. Increase the number of nodes and watch how hubs naturally emerge. Then use the attack slider to compare random failures versus targeted hub removal. Notice how the largest connected component collapses under targeted attack but barely changes under random failure.