Fluid limit and gelation in the frozen Erdos-R\'enyi random graph

Abstract

The frozen Erdos-R\'enyi random graph is a variant of the standard dynamical Erdos-R\'enyi 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…