Connectivity of inhomogeneous random graphs II

arXiv2305.03607MaRDI QIDQ6435522FDOQ6435522

Gopal Viswanathan, Jan Hladký

Publication date: 5 May 2023

Abstract: Each graphon $W:Omeg{a}^{2}ightarrow[0,1]$ yields an inhomogeneous random graph model $G(n,W)$. We show that $G(n,W)$ is asymptotically almost surely connected if and only if (i) $W$ is a connected graphon and (ii) the measure of elements of $Omega$ of $W$-degree less than $alpha$ is $o(alpha)$ as $alphaightarrow0$. These two conditions encapsulate the absence of several linear-sized components, and of isolated vertices, respectively. We study in bigger detail the limit probability of the property that $G(n,W)$ contains an isolated vertex, and, more generally, the limit distribution of the minimum degree of $G(n,W)$.

This page was built for publication: Connectivity of inhomogeneous random graphs II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435522)