Behavior of the Minimum Degree Throughout the $d$-process

Jakob Hofstad

The $d$-process generates a graph at random by starting with an empty graph with $n$ vertices, then adding edges one at a time uniformly at random among all pairs of vertices which…