2025/02/03 by Bénédicte Haas, Haas, Bénédicte, Vincent Viau +1
Computer Science · Mathematics · #05C80 60J75 60J25 #Data Management and Algorithms #FOS: Mathematics #Geometry and complex manifolds #Probability (math.PR) #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.2502.01424
openalex publication_date 2025/02/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The frozen Erdős-Rényi random graph is a variant of the standard dynamical Erdős-Rényi random graph that prevents the creation of the giant component by freezing the evolution of connected components with a unique cycle. The formation of multicyclic components is forbidden, and the growth of components with a unique cycle is slowed down, depending on a parameter p∈ [0,1] that quantifies the slowdown. At the time when all connected components of the graph have a (necessary unique) cycle, the graph is entirely frozen and the process stops. In this paper we study the fluid limit of the main statistics of this process, that is their functional convergence as the number of vertices of the graph becomes large and after a proper rescaling, to the solution of a system of differential equations. Our proofs are based on an adaption of Wormald's differential equation method. We also obtain, as a main application, a precise description of the asymptotic behavior of the first time when the graph is entirely frozen.