Sharper analysis of the random graph $d$-process via a balls-in-bins model

Andrzej Rucinski, Nick Wormald

A graph $d$-process starts with an empty graph on $n$ vertices, and adds one edge at each time step, chosen uniformly at random from those pairs which are not yet edges and whose b…