Local limit of the random degree constrained process

In this paper we show that the random degree constrained process (a time-evolving random graph model with degree constraints) has a local weak limit, provided that the underlying host graphs are high degree almost regular. We, moreover, identify the limit object as a multi-type branching process, by combining coupling arguments with the analysis of a certain recursive tree process. Using a spectral characterization, we also give an asymptotic expansion of the critical time when the giant component emerges in the so-called random $d$-process, resolving a problem of Warnke and Wormald for large $d$.
Comment: 53 pages, 3 figures