Normal approximation for subgraph counts in random intersection graphs: the case of cliques
Let $X^{(r)}_n$ denote the number of copies of a complete graph $K_r$ in the random intersection graph model on $n$ vertices. We derive upper bounds on the distance between the standardized version of $X^{(r)}_n$ and the standard normal distribution, measured in both the Kolmogorov and Wasserstein metrics. We complemen...