The Small Giant Component in Scale-Free Random Graphs

• Authors: Oliver Riordan
• Venue: Combinatorics, Probability and Computing
• Year: 2005

Building on the methods developed in joint work with Béla Bollobás and Svante Janson, we study the phase transition in four ‘scale-free’ random graph models, obtaining upper and lower bounds on the size of the giant component when there is one. In particular, we determine the extremely slow rate of growth of the giant component just above the phase transition. We greatly reduce the significant gaps between the existing upper and lower bounds, giving bounds that match to within a factor $1+o(1)$ in the exponent.In all cases the method used is to couple the neighbourhood expansion process in the graph on n vertices with a continuous-type branching process that is independent of n. It can be shown (requiring some separate argument for each case) that with probability tending to 1 as $n\to\infty$ the size of the giant component divided by n is within $o(1)$ of the survival probability $\sigma$ of the branching process. This survival probability is given in terms of the maximal solution $\phi$ to certain non-linear integral equations, which can be written in the form $\phi={\bf F}(\phi)$ for a certain operator ${\bf F}$. Upper and lower bounds are found by constructing trial functions $\phi_0$, $\phi_1$ with ${\bf F}(\phi_0)\leq \phi_0$ and ${\bf F}(\phi_1)\geq \phi_1$ holding pointwise; basic properties of branching processes then imply that $\phi_1\leq \phi\leq \phi_0$, giving upper and lower bounds on $\sigma$.