Poisson Approximation for the Number of Isolated Complete Graphs in a Random Intersection Graph

Abstract

Let W n,r be the number of isolated complete graphs of order r in a random intersection graph G(n, m, p). In this paper, we demonstrate that W n,r can be approximated by Poisson distribution and give the bound of this approximation by using the Stein-Chen method.