Title: Phase Transition in Inhomogenous Erdős-Rényi Random Graphs via Tree Counting
Author(s): Ghurumuruhan Ganesan
Pages: 1 -- 27
Consider the complete graph $K_n$ on $n$ vertices where each edge $e$ is independently open with probability $ p_n (e) $ or closed otherwise. The edge probabilities are not necessarily same but are close to some positive constant $C$. The resulting random graph $G$ is in general inhomogenous and we use a tree counting argument to establish phase transition in the following sense: For $C<1$, all components of $G$ are small with high probability. For $C>1$, with high probability, there is at least one giant component and every component is either small or giant. For $C> 8$, with positive probability, the giant component is unique and every other component is small. An important consequence of our method is that we directly obtain the fraction of vertices present in the giant component in the form of an infinite series.