The largest component in an inhomogeneous random intersection graph with clustering (Q986718): Difference between revisions

Summary: Given integers \(n\) and \(m=\lfloor\beta n\rfloor\) and a probability measure \(Q\) on \(\{0,1,\dots,m\}\), consider the random intersection graph on the vertex set \([n]= \{0,1,\dots,m\}\) where \(i,j\in [n]\) are declared adjacent whenever \(S(i)\cap S(j)\neq\emptyset\). Here \(S(1),\dots,S(n)\) denote the i.i.d. random subsets of \([m]\) with the distribution \({\mathbf P}(S(i)=A)= \binom{m}{|A|}^{-1} Q(|A|)\), \(A\subset [m]\). For sparse random intersection graphs, we establish a first-order asymptotic as \(n\to\infty\) for the order of the largest connected component \(N_1= n(1-Q(0))\rho+ o_P(n)\). Here \(\rho\) is the average of nonextinction probabilities of a related multitype Poisson branching process.