The Bohman-Frieze Process Near Criticality
Abstract
The Erdos-R\'enyi process begins with an empty graph on n vertices and edges are added randomly one at a time to a graph. A classical result of Erdos and R\'enyi states that the Erdos-R\'enyi process undergoes a phase transition, which takes place when the number of edges reaches n/2 (we say at time 1) and a giant component emerges. Since this seminal work of Erdos and R\'enyi, various random graph models have been introduced and studied. In this paper we study the so-called Bohman-Frieze process, a simple modification of the Erdos-R\'enyi process. The Bohman-Frieze process begins with an empty graph on n vertices. At each step two random edges are present and if the first edge would join two isolated vertices, it is added to a graph; otherwise the second edge is added. We present several new results on the phase transition of the Bohman-Frieze random graph process. We show that the Bohman-Frieze process has a qualitatively similar phase transition to the Erdos-R\'enyi process in terms of the size and structure of the components near the critical point. We prove that all components at time tc- (that is, when the number of edges are (tc-) n/2) are trees or unicyclic components and that the largest component is of size (-2 n). Further, at tc + , all components apart from the giant component are trees or unicyclic and the size of the second-largest component is (-2 n). Each of these results corresponds to an analogous well-known result for the Erdos-R\'enyi process. Our methods include combinatorial arguments and a combination of the differential equation method for random processes with singularity analysis of generating functions which satisfy quasi-linear partial differential equations.