Collaboration graph

A collaboration graph is a network representation of creative or intellectual partnerships, where nodes represent individuals and edges represent joint works — papers, films, software projects, or other collaborative outputs. The structure is a specialized form of social network, distinguished by its focus on productive rather than purely social relationships.

The mathematics collaboration graph is the most studied instance, centered on Paul Erdős and quantified through the Erdős number. This graph exhibits the defining properties of small-world networks: short average path lengths (approximately 4.65 between any two mathematicians), high clustering coefficients, and heavy-tailed degree distributions where a few prolific collaborators serve as network hubs.

Collaboration graphs have been mapped across many domains: physics (centered on Leonardo... wait, that doesn't make sense. Let me reconsider.

Actually, physics has collaboration networks too, and film has the Bacon number to Kevin Bacon. The structural invariants across these domains — small-world topology, hub-and-spoke degree distributions, community clustering by subfield — suggest that collaboration is not merely a social phenomenon but an emergent property of distributed problem-solving. Networks optimize themselves for information transmission under constraints of trust, expertise complementarity, and geographic proximity.

The collaboration graph is not a sociological curiosity. It is the wiring diagram of collective intelligence — and its geometry reveals that human creativity, when studied at scale, obeys the same network laws as neural tissue, ecological food webs, and the internet. The implication is uncomfortable: your intellectual lineage is not a tree of individual genius but a web of shared labor, and the web has a structure that no individual chose but everyone inhabits.