1.00

Growing with Π(k) ∝ kα · centre = first to arrive · biggest hub in gold · newest in orange

Degree distribution (CCDF, log–log)

this network k⁻² guide (γ = 3) Marvel, 303 heroes

Biggest hub's share of all links, against α (press Sweep α)

n = 303 n = 3000 Spider-Man: 106 of 1434 links this run
Nodes
–
Links
–
Biggest hub
–
Its share of all links
–
It arrived as node #
–
Same share in Barabási–Albert (1/√n)
–

What to try. Grow at α = 1 and read the biggest hub's share, then push n from 303 to 3000: the share falls like 1/√n. Now set α = 0.5 and grow again: no hub at all, the tail on the right dies early. Then α = 1.5: one node, almost always the first, keeps a fixed share of every link no matter how large the network gets. Press Sweep α to see all three regimes in one curve, and read off where Spider-Man's 7.4% lands.