CONCEPT

Scale-Free Networks

Networks whose degree distribution follows a power law — a few hubs with enormous connectivity, many nodes with almost none. The structural signature Barabási found everywhere from the web to cells to citations.

A scale-free network is one in which the number of connections per node follows a power-law rather than a bell curve. Most nodes have few links; a small number of hubs have enormously many. Barabási and Réka Albert identified this pattern in 1999 in the structure of the World Wide Web and then, with astonishing rapidity, in protein interaction networks, citation graphs, sexual-contact networks, airline route maps, and the topology of human language itself. The discovery overturned the assumption, inherited from Erdős and Rényi, that complex networks were essentially random. In You On AI Cycle, the scale-free frame reappears wherever the question is whether AI actually flattens hierarchy or merely reproduces it in a new medium.

In The You On AI Field Guide

The Erdős–Rényi model, which dominated graph theory for half a century, assumed that connections between nodes were essentially random — that the resulting degree distribution would be Poisson, tightly concentrated around an average. Height in a human population follows

In The You On AI Field Guide

Keep reading with YOU ON AI