[23] R. PEMANTLE, *A survey of random processes with reinforcement*, Probab. Surveys, 4 (2007), pp. 1–79.

[24] B. PITTEL, *A random graph with a subcritical number of edges*, Trans. Am. Math. Soc., 309 (1988), pp. 51–75.

[25] B. PITTEL, *On tree census and the giant component in sparse random graphs*, Random Struct. Algorithms, 1 (1990), pp. 311–342.

[26] B. RÁTH, *A moment-generating formula for Erdős-Rényi component sizes*, Electron. Commun. Probab., 23 (2018), pp. 1–14.

[27] B. RÁTH AND B. TÓTH, *Erdős-Rényi random graphs+forest fires= self-organized criticality*, Electron. J. Probab., 15 (2009), pp. 1290–1327.

[28] R. ROSSIGNOL, *Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs*, Ann. Probab., 49 (2021), pp. 322–399.

[29] J. L. SPOUGE, *Computation of the gamma, digamma, and trigamma functions*, SIAM Journal on Numerical Analysis, 31 (1994), pp. 931–944.

[30] V. E. STEPANOV, *On the probability of connectedness of a random graph $G_m(t)$*, Theory Probab. Appl., 15 (1970), pp. 55–67.

[31] J. TANNER, *A derivation of the Borel distribution*, Biometrika, 48 (1961), pp. 222–224.

[32] R. VAN DER HOFSTAD, *Random graphs and complex networks. Volume 2*, vol. 54 of Camb. Ser. Stat. Probab. Math., Cambridge University Press, 2024.

[33] V. VIAU, *Near critical asymptotics in the Frozen Erdős-Rényi*. Preprint, arXiv:2405.08664 (2024).

[34] V. VIAU, *Graphes d'Erdős-Rényi gelés*, PhD thesis, Université Sorbonne Paris-Nord, (in preparation).

[35] L. WARNKE, *On Wormald's differential equation method*. Preprint, arXiv:1905.08928 (2019).

[36] N. C. WORMALD, *Differential equations for random processes and random graphs*, Ann. Appl. Probab., 5 (1995), pp. 1217–1235.

[37] N. C. WORMALD, *The differential equation method for random graph processes and greedy algorithms*, in *Lectures on approximation and randomized algorithms*, PWN, 1999, pp. 73–155.