The largest component in an inhomogeneous random intersection graph with clustering

Mindaugas Bloznelis

Given b>0, integers n, m=bn and a probability measure Q on {0, 1,..., m}, consider the random intersection graph on the vertex set [n]={1, ..., n}, where i and j are declared adjac…