On connectivity in a general random intersection graph

There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\mathbb{G}(n,\overrightarrow{a}, \overrightarrow{Kn},Pn)$ defined on a set $\mathcal{V}n$ comprising $n$ vertices, where $\overrightarrow{a}$ is a probability vector $(a1,a2,\ldots,am)$ and $\overrightarrow{Kn}$ is $(K{1,n},K{2,n},\ldots,K{m,n})$. This graph has been studied in the literature including a most recent work by Ya\u{g}an [arXiv:1508.02407]. Suppose there is a pool $\mathcal{P}n$ consisting of $Pn$ distinct objects. The $n$ vertices in $\mathcal{V}n$ are divided into $m$ groups $\mathcal{A}1, \mathcal{A}2, \ldots, \mathcal{A}m$. Each vertex $v$ is independently assigned to exactly a group according to the probability distribution with $\mathbb{P}[v \in \mathcal{A}i]= ai$, where $i=1,2,\ldots,m$. Afterwards, each vertex in group $\mathcal{A}i$ independently chooses $K{i,n}$ objects uniformly at random from the object pool $\mathcal{P}n$. Finally, an undirected edge is drawn between two vertices in $\mathcal{V}n$ that share at least one object. This graph model $\mathbb{G}(n,\overrightarrow{a}, \overrightarrow{Kn},Pn)$ has applications in secure sensor networks and social networks. We investigate connectivity in this general random intersection graph $\mathbb{G}(n,\overrightarrow{a}, \overrightarrow{Kn},Pn)$ and present a sharp zero-one law. Our result is also compared with the zero-one law established by Ya\u{g}an.