Ask a Random Friend

I · A claim that should be impossible

Here it is, plainly: on average, your friends have more friends than you do. This is a comparison of means, not a guarantee about you or a majority. And "most people are below average among their friends" sounds surprising, as does "most children are below the average height of children". Neither is a contradiction: a majority can sit below an arithmetic mean. So what makes the friendship comparison special?

The catch is in the words your friends. When you list the friends of friends, popular people get listed over and over, once for every friend they have, and unpopular people barely get listed at all. The crowd you average over is not the crowd of people; it is a crowd weighted by popularity. You are not sampling the room. You are sampling the room as it is seen through its friendships, and that lens magnifies the hubs. The phenomenon was described and proved by the sociologist Scott Feld in 1991, in Why Your Friends Have More Friends than You Do.

Don't take it on faith. Below is a real social network: 34 members of a 1970s university karate club, in the standard 78-tie version of the network an anthropologist recorded before the club split in two. It is a widely studied small social network. Click to pick a random person, then ask that person for a random friend, and watch the two running averages pull apart.

II · Why it is forced

The size of the surprise is not vague. Write μ for the average number of friends and σ² for the variance in that number — how unevenly friendships are spread. Feld's result is a single line: the mean degree of a randomly chosen friend (follow a random friendship to one of its two ends) is

μ  +  σ² / μ.

The extra term σ²/μ is the whole paradox. It is never negative, so a random friend's degree is always at least the average — and it is strictly larger the moment friendships are spread unevenly at all (σ² > 0). The only way to escape it is a world where everyone has exactly the same number of friends — a perfectly regular network — and then, and only then, the gap is zero.

You can check the whole thing by hand on a small case: a star, one centre joined to four leaves. Degrees are 4, 1, 1, 1, 1; the mean is μ = 1.6; the variance works out to σ² = 1.44; so the average friend has 1.6 + 1.44/1.6 = 2.5 friends. Every leaf's only friend is the centre, with four; so of course the friends look popular. Switch the network below and watch the gap appear and vanish.

III · Most of you — not all of you

The honest statement is careful, and the care is the interesting part. The theorem is about averages. It does not say every single person is below their friends; a few people, the hubs themselves, beat their friends easily. The theorem does not guarantee a majority; the network decides exactly how many are below. In the karate club, 29 of 34 members have fewer friends than the average of their own friends. Five do better. The colouring below is computed live: blue for the deprived majority, rust for the popular few.

There is a second subtlety worth its own sentence, because nearly every popular retelling blurs it. "Follow a random friendship to a random end" (what the formula μ + σ²/μ measures) is not the same as "pick a random person, then average over their friends." The first depends only on the degree distribution; the second also depends on who befriends whom: whether hubs cluster together or collect followers from the edges. On the karate club the second number is even larger (9.61 versus 7.77 friends), because its low-degree members hang off a few central figures. Both exceed the plain average here; only the first has a value fixed by the degree distribution alone.

IV · The same trick, pointed at a virus

Now the turn that lifts this out of curiosity. If asking for a random friend reliably hands you someone more connected than average, then a random friend is, on average, closer to the centre of the network — and people near the centre catch a spreading thing sooner. So here is a way to build an early-warning system for an epidemic without ever mapping the network: take a random sample of people, ask each to name a friend, and monitor the friends. They are your sentinels. They light up first.

This is not a thought experiment. In the autumn of 2009, Christakis and Fowler did exactly this with 744 Harvard undergraduates during the H1N1 flu. The friend group's epidemic curve ran 13.9 days ahead of the random group's (95% CI 9.9–16.6) — and crossed into significant warning a full 46 days before the peak in the population at large. A later study used the same idea on Twitter, with the friends of random users adopting viral hashtags about 7 days before the crowd. Below, run a simulated outbreak on a scale-free crowd and watch the two curves separate.

The same lever vaccinates. If you can only reach a fraction of a population and you don't know who the hubs are, immunize a random friend of a random person instead of a random person; the friend is more likely than a random person to be highly connected, and those connections give an epidemic more routes. Cohen, Havlin and ben-Avraham proposed this "acquaintance immunization" in 2003 and showed it dramatically lowers the threshold for stopping an outbreak, with no global knowledge of the network. In our simulation, vaccinating 15% of a scale-free crowd by random friends shrinks the largest still-connected component to 702 people; vaccinating the same 15% at random leaves 839; the friend-picked group averages more than twice the degree of the random one, and that is the entire difference.

And it generalises past friend-counts. Eom and Jo showed in 2014 that any trait that travels with popularity inherits the paradox: in scientific collaboration networks your coauthors have, on average, more coauthors, more citations, and more papers than you do. The rule is exact — the paradox holds for a trait precisely when that trait is positively correlated with degree, and it reverses for a trait correlated the other way. Popularity is contagious to the statistics that ride alongside it.

V · What is true, and what is modelled

The core is a theorem and is exact: μ + σ²/μ ≥ μ, with equality only on a regular network. The standard karate-club network has 34 represented members and 78 ties. Its numbers, mean 4.59, average friendship endpoint 7.77, gap +3.18, 29 of 34 below, are recomputed in your browser from this edge list and re-derived offline. The star and the regular ring are there precisely so you can watch the gap appear and vanish at the two extremes.

The two application panels are simulations, and say so: the sensor lead and the immunization gap are computed on synthetic scale-free networks, to show the mechanism. The real-world numbers (the 13.9-day flu lead, the ~7-day Twitter lead, the lowered immunization threshold) belong to the cited studies, not to this page. The honest edges, stated rather than hidden: the always-true formula is the mean over a random friendship-end, not over a random person's friend-list; the majority is measured on this club, not guaranteed for every network, and Feld's headline 74% carries a sampling assumption; and the generalized paradox is cleanest as a network-level statement (it has been contested at the level of the individual node). None of that dents the spine. Your friends really do, on average, have more friends than you. It just isn't anyone's fault.