On the Giant Component of Geometric Inhomogeneous Random Graphs

In this paper we study the threshold model of \emph{geometric inhomogeneous random graphs} (GIRGs); a generative random graph model that is closely related to \emph{hyperbolic random graphs} (HRGs). These models have been observed to capture complex real-world networks well with respect to the structural and algorithmic properties. Following comprehensive studies regarding their \emph{connectivity}, i.e., which parts of the graphs are connected, we have a good understanding under which circumstances a \emph{giant} component (containing a constant fraction of the graph) emerges. While previous results are rather technical and challenging to work with, the goal of this paper is to provide more accessible proofs. At the same time we significantly improve the previously known probabilistic guarantees, showing that GIRGs contain a giant component with probability $1 - \exp(-Ω(n^{(3-τ)/2}))$ for graph size $n$ and a degree distribution with power-law exponent $τ\in (2, 3)$. Based on that we additionally derive insights about the connectivity of certain induced subgraphs of GIRGs.