The same internal announcement goes out at two companies. At one, everybody knows within two days. At the other, three weeks later some people still haven't heard. The people are comparable, the announcement is identical. The difference is who is wired to whom — and when we explain what happened, that is the one thing we almost never look at.
The next six issues are about networks. The word has been worn out, so let's push it back down to something plain: a picture of who is connected to whom. Dots and lines. Nothing else.
What's counterintuitive is how much that absurdly impoverished picture can eat. Take two groups with identical abilities, identical motives, identical rules, change only the wiring, and watch an outcome flip. Wiring is a variable you can measure on its own, separately from content. This issue does one thing: measure it.
There is history in that step. In 1736 Euler settled the Seven Bridges of Königsberg, proving no route crosses all seven exactly once — and graph theory was born, asking yes-or-no questions of the form "does such a path exist?" Network science asks something else: given a real graph with tens of thousands of nodes, what do its statistics look like, and how will things travelling on it — messages, money, infections, failures — actually move? The first wants an answer; the second wants a distribution.
01Same people, different wiring
Vocabulary first. Each thing in the graph is a node — a person, a server, a species. A relationship between two nodes is an edge. How many edges a node has is its degree.
Now a controlled experiment. Two graphs, each with 12 nodes and 12 edges, so each node has on average two connections — the average degree is identical. Only the wiring differs: on the left everyone connects to their two neighbours around a ring; on the right two people each hold a fan of connections, with a single link between the two fans.
Run the same rule on both: start somewhere, pass the message to all your neighbours each round, three rounds.
Same rule, same headcount, same total number of ties. The only difference is the wiring, and the outcome differs by nearly a factor of two.
Seven on the left, all twelve on the right. The number you reach for most often — "how many people does the average person know" — is exactly equal across these two graphs and therefore carries no information about the outcome.
What does the work is how degree is spread: on the left everyone has degree 2; on the right two nodes have degree 6 and most have degree 1. That spread is the degree distribution, the most basic fingerprint a network has. When it is heavy-tailed — a few nodes enormous, most tiny — the average becomes the trap the last issue was about → ref · Spotting and Misreading Power Laws.
🎯 DECISION LINE
Before you attribute an outcome to a person, spend an hour drawing the graph. Not the org chart from memory — use traces: who reviewed whose code in the last three months, who tagged whom in which ticket, who sat in which meeting with whom. Then check whether your original explanation still stands. Most of the time the person you were about to blame turns out to be standing on the one position everything has to pass through.
🌀 Architecture and planning · Christopher Alexander, "A City is Not a Tree" Alexander's famous 1965 critique: planned new towns chop function into non-overlapping blocks — a tree; naturally grown old cities have overlapping user-sets for the corner shop, the newsstand, the bus stop, the pavement — a semilattice. In this section's terms: nearly the same nodes, entirely different edge overlap. Which yields a conclusion planners of the day would not accept: the lifelessness of the new town isn't a wrong mix of functions, it is that the wiring itself was forced into a shape that forbids overlap — so no amount of re-tuning the mix can recover it.
02Three rulers
Describing "the wiring" takes at least three numbers, because they measure three different levels.
Degree measures the most local thing: how many people you connect to. Shortest path length measures the most global: the fewest hops from here to there. Average it over all pairs and you get the graph's average shortest path length — roughly "how many hands a message typically passes through to get from anyone to anyone".
One level is missing in between, and it's the one people skip: the clustering coefficient. It asks — do your friends know each other? Take all pairs of your neighbours, count how many pairs are already acquainted, divide by the number of pairs. All of them is 1; none of them is 0.
Degree asks "who am I tied to", path length asks "how many hands across the whole graph", clustering asks "do my people know each other".
That last line is the point: the three are independent. A graph can have high clustering and long paths (everyone within a village knows everyone, but villages are far apart) or low clustering and short paths (a hall where everyone knows only the host, yet any two people are two hops apart). Quoting a single number and calling a network "tight-knit" says nothing at all.
Incidentally, high clustering and short paths appearing together is both strange and extremely common. It has its own name, and the next issue is about it.
🌀 Eastern thought · Indra's Net in Huayan Buddhism The famous image: a net hangs in the palace of Indra, a jewel at every knot, each jewel reflecting every other jewel, endlessly. Read it with this section's rulers and something hard falls out: the image demands a path length of 1 between any two jewels and a clustering coefficient of 1 — a complete graph. And a complete graph's edge count grows with the square of the node count, which no real system with maintenance costs can afford. The conclusion isn't that the metaphor is bad; it is that real-world "everything contains everything" has to be routed through a few hubs to exist at all, and is therefore inherently unequal — whereas the whole moral weight of Indra's Net comes from the jewels reflecting each other as equals. That gap is not rhetorical. It is topological.
03"Who matters most" has four answers
Now the question everyone actually wants to ask: who is the most important node here?
There is no single answer, and not because the question is hard. Because it is incomplete. The family of measures is called centrality, and the four common ones correspond to four different kinds of importance → ref · Network Centrality Measures:
Degree centrality is just degree — most ties. Closeness centrality is the smallest total distance to everyone else — you sit closest to the whole crowd on average. Betweenness centrality counts how many pairs of nodes have their shortest path running through you — how many people you are the route for. Eigenvector centrality is recursive: you matter because the people connected to you matter — Google's PageRank is a variant of it.
The graph below is the standard teaching example in social network analysis, Krackhardt's "kite": ten people, eighteen ties. Three centralities pick three different people.
D is the busiest, F and G sit most centrally, and the one actually holding the throat is H, with three ties.
H has three ties and ranks in the lower half by degree. But every route from I and J to everyone else must pass through H — remove H and the graph falls into two pieces. The busiest person and the critical person are not the same person, and they are often nowhere near each other.
So which measure? It depends on what flows, and how it flows. Things that can be copied and travel in all directions at once — a message, a joke, a habit — call for degree and eigenvector centrality. Things that cannot be copied and must traverse a route — a payment, a shipment, a patient referral, an introduction made in person — call for betweenness and closeness. Pick the wrong measure and you will protect the wrong people.
🎯 DECISION LINE
Before computing any centrality, write one sentence: what flows on this graph, and can it be copied. If you can't write that sentence, don't compute — someone will believe the resulting ranking, and a ranking with no stated flow is about as reliable as a horoscope. Once you can write it, the sentence picks the measure. You don't.
🌀 History and technology · Finding Paul Revere from metadata In 2013 the sociologist Kieran Healy published a famous demonstration: take only the membership rosters of Boston clubs in the 1770s — nothing anyone said or wrote — link people who belong to the same club, compute betweenness centrality, and the top of the list is Paul Revere. His point was that "we only collect metadata, never content" is no comfort at all. This section's mechanism explains why: "who is the key person" is a purely structural quantity, computable without any content whatsoever. Protecting content and protecting structure are two different jobs, and doing the first perfectly does nothing for the second.
04A network is not a uniform blob
So far the graph is just dots and lines. Real relationship graphs are almost never uniform: edges bunch into dense blocks with only a few strands running between them. The blocks are called communities.
The trouble is that "it looks like it splits into blocks" is a subjective statement. To make it computable, Newman and Girvan introduced modularity (usually written Q) in 2004. Its definition is one sentence: the fraction of edges that fall inside your proposed blocks, minus the fraction you would expect if every node kept its degree but all the edges were rewired at random.
That second half is the whole trick — it is the zero point of the ruler. Any partition traps some edges inside it, so the raw fraction flatters you. Subtract what chance would give, and what remains is the part that is genuinely blocky.
Modularity does not count edges inside blocks; it counts how many more there are than random wiring would give. On the right the colours are unchanged and Q goes negative.
There is a lovely real-data test of this. In the 1970s the anthropologist Wayne Zachary recorded the private ties among the 34 members of a university karate club. The club later split in two after the instructor and the president fell out. Working only from the tie graph, Zachary's partition matched the actual sides with a single member misplaced. Who had drunk with whom had written the ending before anything was said at a meeting.
Community structure also turns Topic 3's near-decomposability from a philosophical claim into a computable number: Simon argued complex systems must be tight-within, loose-between; modularity is the scale on which that "must" is read off.
A necessary warning: Q is not an absolute score. Fortunato and Barthélemy proved in 2007 that it has a resolution limit — modularity-maximising algorithms systematically fail to see communities below a certain size, and that size grows with the total number of edges in the graph. The same small clique gets absorbed into its neighbours in a large graph while being detected easily in a small one. So Q compares different partitions of one graph. It cannot compare two graphs of different sizes.
🌀 Ecology · mutualistic and trophic networks are shaped differently Thébault and Fontaine compared two kinds of ecological network in 2010: plants and their pollinators, versus who eats whom. The first is highly connected with little clear modularity; the second is distinctly blocky. Read through this section's mechanism, that is not an aesthetic difference but a difference in stability machinery — blocks keep a disturbance inside one module, which suits predation, where one shock can be lethal; the absence of blocks spreads any effect thinly across the whole graph, which suits mutualism, where one pollinator more or less hardly matters. Hence a counterintuitive conclusion: modularity is not generically good design. It is good design against a particular kind of disturbance. Scoring a system by its modularity without asking what hits it is grading an answer without reading the question.
05Where this breaks down
"Draw the graph first" is this issue's claim. Here is where it will drive you into a ditch — and these four points matter more than the previous four sections combined.
First, the graph you drew is probably wrong. Real edges are always a sample: you see the interactions that left a trace, never the sentence spoken in the corridor. And centrality is brutally sensitive to missing edges — betweenness above all, because it lives off the property of being the only route; add one edge and someone's betweenness can halve. Worse, the threshold for "close enough to count as an edge" is yours to set, and moving it one notch reshuffles the ranking. So the second decimal place of a network metric is meaningless. What you can use is orders of magnitude and rank order — and even the rank order needs a threshold sweep.
Second, and most dangerous: structural correlation is not structural causation. A widely reported 2007 study claimed obesity "spreads" through social networks — when your friend gains weight, your odds of gaining weight rise measurably. The methodological objection that followed is very hard to answer: Shalizi and Thomas showed in 2011 that in observational social network data, contagion and homophily (the tendency of like to befriend like) are generically indistinguishable. Connected people resembling each other might mean A influenced B; it might mean A and B were already alike and that is why they became friends; it might mean they live on the same street and shop at the same supermarket. All three leave identical data behind.
"Connected people are more alike" is a genuine observation. It is compatible with three quite different causal structures — and the right intervention is opposite in each.
The practical stakes are high. If it is contagion, intervening on hubs is correct. If it is homophily, hub intervention wastes money and the thing to change is the sorting mechanism that piles like with like. If it is shared environment, what needs changing is neither the people nor the edges but the environment. The three prescriptions are mutually exclusive, and a beautiful network diagram is perfectly indifferent between them.
Third, static snapshots systematically overstate reachability. The graph shows A—B—C, so you assume a message can get from A to C. But if A met B after B met C, that route does not exist in time. Flattening timed interactions into one static picture converts a great many impossible routes into apparent ones — which is why spreading models built on static graphs run optimistic.
Fourth, being drawable as a graph doesn't mean it should be. Define any pairwise relation over anything and you get a network, and then every metric becomes computable. But computable is not the same as meaningful. A centrality number means something only if something really does travel along the edges; if an edge is just "these two feel related to me", then the betweenness you compute is your own intuition re-sorted and given a decimal point for polish.
🎯 DECISION LINE
Before acting on a network result, clear three gates: (1) how was an edge defined, and does the conclusion survive moving the threshold; (2) are you claiming correlation or causation — if causation, state what rules out "they were already alike" and "they share an environment"; (3) is there a time order, and is your static reachability inflated? Fail any of the three and treat the graph as a map, never as a causal model.
🌀 Archaeology · trade networks rebuilt from potsherds Network analysis has taken hold in archaeology over the last twenty years: treat the similarity of finds between two sites as an "edge" and reconstruct ancient trade. The catch is that "how similar counts as an edge" is entirely the researcher's call, and moving the threshold moves which city comes out as the hub. This is the first point of this section in its most extreme form, in a field that cannot collect more data: a modern social network can be re-scraped, two-thousand-year-old pottery cannot. The response is not to give up, it is to change the reporting format — never report "this city was the hub", only "this city stays the hub across this range of thresholds". A conclusion's credibility is exactly the width of the threshold sweep it survives.
🎒 In Practice · BigCat
Engineering & teamsCross-team work keeps stalling at the same point and the retro says "communication problems". Try this instead: turn the last three months of actual collaboration (code reviews, ticket mentions, shared meetings) into a graph, compute betweenness, and look at the top two or three. They are usually not the busiest people; they are the people every cross-module route has to pass through. The change to make is not more headcount for them — headcount raises degree and does nothing for betweenness — but a parallel route for every bridge they carry: a second reviewer, a second interface owner. Simple test: give that person a week off, and if several lines stall at once, you found it.
Practice & mind"Why do I keep getting pulled around by this same kind of thing" gets treated as a question about temperament. Before working on temperament, draw the graph: map the relationships that actually moved your decisions this past year — not your contacts list, but "whose word did I end up going with". Very often a low-degree, high-betweenness shape appears: one person or one source is your only route to something you care about. The thing to change is to add a parallel route — one more person you can ask about the same thing. Most of the pull a sole route exerts drops away once there is a second edge; practising equanimity while the route stays unique is asking temperament to patch a hole in the topology.
InvestingDiversification usually gets measured as number of positions — that is degree. What actually shapes a drawdown is community structure: whether those positions share a funding source, a supply chain, a regulatory regime. The metric to change: swap "how many do I hold" for "if I group them by common exposure, what share of the book is the largest group". And remember section four's warning — such groupings are very unstable on small samples, so read the order of magnitude (is the biggest group 30% or 70%), never the decimals.
🌀 Crossings
Linguistics and anthropology · Structuralism: Saussure argued a word's value lies not in itself but in its differences from other words — his famous claim being that in language there are only differences, with no positive terms. Lévi-Strauss applied the same move to kinship and myth: a mytheme means nothing alone, meaning lives in its oppositions. This issue's four sections are the computable version of that programme: node attributes can be erased entirely (section one) and relations alone still generate different macro outcomes; "important" turns out to be a relational quantity rather than a property (section three); and blocks standing in opposition to blocks are built into the structure (section four). But here it does not hold: structuralism assumes structure is synchronic, closed, its boundary given — the language is that language, the kinship system is that system. Section five shows that in real networks the boundary and the edge threshold are chosen by the analyst, and every metric drifts with the choice. The analyst's subjectivity that structuralism most wanted to escape comes back untouched, in the form of "who did you include in the graph". What transfers is the ruler — meaning is in relations, not elements. What does not transfer is the premise that the structure is objectively given.
History and politics · the rise of the Medici: Padgett and Ansell reconstructed the marriage and economic networks among the elite families of early-fifteenth-century Florence in 1993, asking how Cosimo de' Medici went from merchant to de facto ruler in twenty years. The answer on the graph is purely structural: Medici betweenness far exceeded every rival's, and more importantly their allies did not intermarry with each other, sitting in mutually unconnected communities, while the oligarch families were densely married among themselves. In this issue's terms: the Medici held the sole-route position (section three) and their neighbours belonged to different blocks (section four) — so every ally could only reach anyone else through the Medici, while every combination among the oligarchs needed the Medici not at all. Which yields a rather rude historiographical conclusion: explaining Cosimo's success does not require issuing him a genius for strategy. Padgett's own term is that his action was "robust" — precisely because in that structural position, ambiguous and not-quite-consistent action can satisfy several mutually unconnected parties at once, something a man with a clear stated intention could not do.
Neuroscience · a complete wiring diagram still isn't enough: C. elegans is the one animal whose wiring diagram has been fully mapped — in 1986 White and colleagues drew every synapse among its 302 neurons. Forty years on, the degree distribution, path lengths and community structure of that graph have all been computed, and it still does not let anyone derive from the graph when the worm will turn. The reason is exactly the ceiling of this issue's mechanism: structure constrains what is possible — which signal could reach where, in how few steps — not the dynamics: put a different set of response rules on the same graph and the behaviour changes completely. That draws a precise line under "draw the graph first". Drawing it converts "why this person" into "why this position", which is real progress. But a position fences off what can happen; it does not tell you what will. People who treat a network diagram as a causal model have usually mistaken a constraint for a mechanism at exactly this step.
Going deeper
If structure matters this much, why is changing it the hardest thing in any organisation?
Because the graph that does the work isn't the org chart, it's the untraced one — who trusts whom, who owes whom a favour. An announcement can rewrite the first; the second only moves as the cost of interacting changes. That is also why the three months after a reorg look exactly like the three months before: the formal graph changed, the graph messages actually travel on didn't.
Is a high-betweenness person an asset or a risk?
They are the same thing. That person is the source of efficiency (nothing has to detour), the single point of failure, and the occupant of a position that can collect rent — every cross-block exchange has to be visible to them. So "should we add redundancy to this bridge" is never a purely technical question: redundancy strips positional power from a specific person, and that, not the engineering, is why it doesn't get done.
Can network metrics be gamed?
Yes, and any published metric certainly will be — this is Topic 26's Goodhart problem in network form. Search ranking is the complete demonstration: PageRank is eigenvector centrality, and link farms appeared the moment it became public. So any scheme that uses centrality for promotion or resource allocation has to start by asking how cheaply the evaluated party can add edges.
Does "draw the graph first" contradict "don't be reductionist"?
It doesn't, but it can turn into a second reductionism. Assigning everything to structure and assigning everything to individual character make the same error — both claim one level explains it all. The defensible version of this issue's claim is the weaker one: before attributing to individuals, the structural variable should be netted out, because it is cheap, measurable, and frequently eats most of the explanatory power. What is left after netting it out is where people come in.
Further reading
Mark Newman, Networks (2nd ed., the standard textbook)