Rich get richer — but being rich is not yet being scale-free
2026-08-08 · Networks
Your phone holds a couple of hundred numbers, and nobody you know holds twenty thousand. Online, one account has twenty million followers and the next has twenty, and that is not an anomaly — it is the normal condition. Same quantity, "how many connections"; on one side it has a typical value, on the other it has none. The difference is not in the people. It is in the wiring rule.
Last issue's world had no celebrities: everyone held roughly the same number of ties, a few of them crossed between circles, and that was enough to make distances short. Real networks contain something extra — giants. One airport carries hundreds of routes, one page is pointed at by millions, one protein takes part in hundreds of reactions. These nodes are not statistical outliers; they are the standard furniture of such networks.
Here is the counterintuitive turn. Explaining giants requires no assumption that they are better, stronger, or saw something earlier. Two rules — dull to the point of being neutral — are enough. And the same two rules predict a second thing: giants will certainly appear, and which node becomes one is essentially unpredictable. Those two sentences have to be said separately. Said together, they become a success story.
The division of labour with the next issue, up front: this one is about how hubs grow and how strong the evidence for the claim actually is; Topic 23 is about what follows from having hubs (near-immunity to random failure, instant collapse under targeted attack). And the last section here is a rare instance of this site dismantling its own material — "scale-free" is the most heavily marketed word in complexity science, and its evidence is much weaker than the popular books suggest.
To see how strange something is you first need a control. Around 1959 the mathematicians Erdős and Rényi studied the laziest network imaginable: take N nodes, flip a coin for every pair, and draw an edge on heads. This is the random graph.
The number of edges a node holds is its degree. In a random graph the degrees follow what is called a Poisson distribution, and the meaning of that term is plain: almost every node sits close to the mean, twice the mean is already rare, and three times the mean effectively does not occur. In everyday language — it has a typical value.
Height is like that. The mean is around 1.7 m, you have seen two metres, you will never see five. Wealth is not like that, and neither is follower count. So the question is concrete: what kind of wiring produces the picture on the right?
Note that both sides carry the same number of edges. That matters: giants are not the product of more resource. Hand out the same resource under a different allocation rule and no giant appears.
To judge whether a system will grow giants, do not look at how concentrated it is now — look at how the new connections are allocated. If new links land uniformly at random, no giants. If they land in proportion to what each node already holds, giants are guaranteed. This is directly measurable: take the connections created recently (new users, new citations, new dependencies, new orders), sort them by the recipient's existing stock, and see whether the slope is flat or positive.
In 1999 Barabási and Albert pointed out two things the random graph leaves out — and adding just those two is enough.
First, the network grows. The random graph assumes every node is present from the start and merely unconnected. Real networks are not built that way: pages are created one at a time, papers written one at a time, people register one at a time. Second, arrivals do not choose uniformly. A newcomer is more likely to attach to nodes that already hold many edges. That second rule is preferential attachment — "preferential" describes a bias in probability, not a preference in anyone's mind.
That deserves a sentence more, because it is the part most often misread as psychology. There is no intention in the rule: when you reach for a page to cite, you are more likely to land on one that many others have already cited simply because it is easier for you to come across. Preference is the name of the outcome, not the name of its cause. → ref · the preferential attachment model
The degree distribution that comes out is a power law: the number of nodes holding k edges is proportional to k to the minus three. That 3 is derived from the rules, not fitted to data — which will matter later.
The exact meaning of scale-free here is this: the distribution has no typical value, so there is no "usual number of connections" that represents the network. It is not the mystical claim that there is no scale; it is the concrete statistical property of having no characteristic scale.
Both rules are needed, and this gets skipped. Growth with uniform attachment gives an exponential distribution and no hubs. Preferential attachment on a fixed set of nodes — no growth, just edges piling on — never settles: the distribution is not stationary, edges keep accumulating, and the network ends up connected to everything, with the power law only a phase it passes through. What does the work is the combination: a growing system allocating its increments in proportion to stock, not either piece alone. The same skeleton has an older name in probability theory → ref · the Pólya urn.
This model has one great virtue: it can be solved. The i-th node to arrive holds, by the time the network has grown to t nodes, a degree of kᵢ(t) = m·√(t/tᵢ) — where m is the number of edges each newcomer brings and tᵢ is when that node entered.
Read the formula again: degree depends only on when you arrived. Every node in the model is identical; arrival order is the only difference, and time amplifies it as a square root.
This is what first-mover advantage means under this mechanism, and it is both stronger and weaker than the usual claim. Stronger, because the early node need not do anything right — pure arrival order suffices. Weaker, because it holds only under the model's assumptions, and those break quickly.
The obvious counterexample is search. Google entered in 1998, long after the link structure of the web had formed, and by the formula above should never have caught up. Bianconi and Barabási supplied the missing piece in 2001: give every node a fitness η, and allocate new edges in proportion to η times degree. Now a young but fit node really can overtake; and under some fitness distributions the system enters a winner-takes-all phase whose equations are those of Bose–Einstein condensation in physics, with the fittest node taking a finite fraction of all edges in the network.
So does success actually breed success in real systems? In 2014 van de Rijt and colleagues ran a fine field experiment on Kickstarter, Wikipedia, Epinions and Change.org: pick recipients at random, give each a small initial success — a modest pledge, an award, an upvote, a signature — then do nothing further and watch. On all four platforms the randomly favoured group went on to succeed at significantly higher rates: on Kickstarter 70% of the projects given one random pledge attracted further funding, against 39% of the controls. But the effect showed diminishing returns rather than unbounded amplification. Reality, in other words, looks more like the version with fitness than like pure preferential attachment.
A small head start early really is worth betting heavily on — but only while two conditions hold together. (1) The system is still growing: stop the growth and preferential attachment stops with it, freezing shares where they are instead of widening them. (2) New connections really are allocated by stock — measure this, don't assume it. Concretely: replace "cumulative share" on the dashboard with "share of the most recent period's new connections". The moment those two curves diverge is the moment fitness has overtaken stock, and the cumulative curve will not show it for several periods.
Now the provenance of this idea, and the beating it later took. Neither appears often in the popular accounts.
Provenance first. "Rich get richer" had been independently discovered at least three times before 1999. The statistician Yule used it in 1925 to explain why some biological genera contain hundreds of species and others one. Simon wrote the same skeleton in general form in 1955, applying it to word frequency, income and city size. And Price moved it explicitly onto networks in 1976 — he was studying citations between papers, and he called the mechanism cumulative advantage.
This is not trivia. A mechanism rediscovered repeatedly is usually a basic one; but it also means what was genuinely new in 1999 was attaching it to networks as an object and giving it a marketable name — not "rich get richer" itself. And it was the name that went on to carry far more weight than the evidence could bear.
Now the beating. In 2019 Broido and Clauset did something dull and useful: they ran one strict statistical procedure over all 927 real networks they could assemble — social, biological, technological, transport, informational, no cherry-picking. Sorting them into five levels of evidence, they found that only 4% reached the strongest level; 57% reached at least one level; and half of all social networks failed to reach even the weakest. The most awkward finding: for most of these networks a log-normal distribution fits as well as a power law, or better.
The paper drew an immediate rebuttal. Voitalov and colleagues published "Scale-free networks well done" the same year, arguing the definition was too strict: if a power law is defined as statisticians standardly do — as a regularly varying distribution, constraining only the tail and letting the low-degree region deviate freely — then scale-free networks are not rare at all.
So the honest state of play is this. Almost nobody disputes that real degree distributions are heavy-tailed — the large nodes are far larger than a random graph permits. What is disputed is how "power law" should be defined and where the evidential bar sits. The popular line, "real networks are scale-free", merges two claims of very different strength into one.
Never hang a decision on the numeric value of the exponent — it is sensitive to the lower cutoff and to the observation window, and two analysts can differ by 0.5 on the same data. Report two quantities that are insensitive to the distributional assumption instead: the maximum degree as a multiple of the median degree, and the share of all connections held by the top 1% of nodes. Both map directly onto what you actually need to do — who to watch, whose loss would hurt — and anyone can recheck them.
The previous section was about strength of evidence. This one is about the boundary of the mechanism itself — when preferential attachment gives you no power law at all, and when the heavy tail you observe is not a property of the system.
First, "allocate by stock" has to be strictly proportional, and near enough is not good enough. In 2000 Krapivsky, Redner and Leyvraz worked out the general case: if new edges are allocated in proportion to degree raised to the power α, only α = 1 — strict proportionality — yields a power law. Slightly below 1, the hubs are flattened and the distribution becomes a stretched exponential; above 1, links collapse onto a handful of nodes, and further up almost every edge ends at a single one. It is a knife-edge condition. And in 2003 Jeong, Néda and Barabási measured the actual allocation of new edges in four real networks: citations and the internet came out close to linear, while actor collaboration and scientific co-authorship were sublinear. So "preferential attachment is running here" and "a power law should appear here" are two different statements.
Second, your measurement may manufacture the heavy tail by itself. This one is brutal. Internet topology is among the most famous scale-free cases, and its early evidence came from traceroute — start at one source, record the shortest paths to many destinations, stitch the visible edges into a graph. In 2005 Achlioptas, Clauset, Kempe and Moore proved that this sampling method yields an observed power law even when every node in the underlying graph has exactly the same degree.
Third, the things the BA model explicitly does not predict. The networks it generates have almost no clustering — the chance that two of your neighbours know each other approaches zero; no community structure; nodes that never die; edges that never rewire. Real networks violate all four. So using this model for any question that turns on clustering, communities or exit is using the wrong tool, however well its degree distribution fits.
Fourth, inferring mechanism from shape means inverting a many-to-one map. That case was made last issue → ref · identifying and misidentifying power laws; here is the network-specific roster: preferential attachment, fitness, duplication–divergence, random proportional growth, and the pure sampling bias above all deliver the same tail. To claim which one is running, go and measure some other observable consequence of it — for instance measure the allocation of new edges directly, instead of only glancing at the degree distribution.
Fifth, and most worth keeping: scale-free is not a medal. It does not mean the system is more efficient, more advanced or more "organic", nor that someone designed it better. It is a statement about the shape of a degree distribution, and a fairly weak one. Much of the reason the word travelled so far is that it sounds like it is saying something profound.
What is left is the part that can be measured separately. Preferential attachment predicts that the allocation of new links depends on stock alone, independent of any intrinsic property of the target. Brand and network effects claim there is a premium that does not vary with stock — which is precisely the η of the fitness model. To separate them, compare the new links won by two targets holding equal stock but differing in the property; if there is no systematic difference, the much-discussed "brand" may just be another name for stock.
Under pure preferential attachment it freezes: with no new nodes arriving there are no new edges to allocate, and shares stay where they are. That yields something counterintuitive — in a market that has stopped growing, the penalty for arriving late stops increasing. But mind the premise: in reality, once growth stops the existing edges usually start being reallocated (customers churn, citations age, dependencies get replaced), and that is a different dynamic on which this issue's model is entirely silent.
One workable answer: change the most suspicious step and see whether the conclusion survives. Traceroute's problem is "looking out from a handful of sources", so add sources, or read topology from routing tables instead. More generally: write down the sentence "if this tail is an artefact of sampling, then changing the sampling to X should make it disappear", then go and do X. If you cannot write that sentence, the measurement is not falsifiable.
More than you would expect. Those conclusions really depend on there being a few nodes with degrees far above the rest, not on the distribution obeying one particular formula — a log-normal tail is heavy enough to have hubs too. What does collapse are the quantitative results that depend on the exponent's value, such as the claim that the percolation threshold under random failure tends to zero, which holds only for γ < 3.