Phase transition
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
The moment everything joins up
Add edges to a set of points one chance at a time and the graph goes from dust to a single piece — not gradually, but over a window that narrows as the point count grows. The last obstacle is almost always a single point with no edge at all, and that is what fixes where the change happens.
The moment a giant appears
Raise the chance of an edge slowly and a random graph does nothing for a long time, then in a narrow window acquires a component holding a definite fraction of everything. The fraction is the root of an equation, and the equation says why the transition is where it is.
Two thresholds, not one
A random graph acquires a piece holding most of its points at average degree one, and is still not connected. Connectivity waits until the average degree reaches the logarithm of the size, and what holds it up is the very last isolated point.
Named alongside it
The objects these essays reach for when they reach for this one.
ExpectationRandom graphThresholdComponentConnectivityIsolated vertexBranching processCoupon collectorFirst momentFixed pointLabelled graphPercolation