Poisson approximation of counts of subgraphs in random intersection graphs

Katarzyna Rybarczyk, Dudley Stark

Random intersection graphs are characterized by three parameters: $n$, $m$ and $p$, where $n$ is the number of vertices, $m$ is the number of objects, and $p$ is the probability th…