Equivalence of the random intersection graph and G(n,p)
Combinatorics
2015-01-13 v2 Probability
Abstract
We solve the conjecture posed by Fill, Scheinerman and Singer-Cohen and show the equivalence of the sharp threshold functions of the random intersection graph G(n,m,p) with and a graph in which each edge appears independently. Moreover we prove sharper equivalence results under some additional assumptions.
Cite
@article{arxiv.0910.5311,
title = {Equivalence of the random intersection graph and G(n,p)},
author = {Katarzyna Rybarczyk},
journal= {arXiv preprint arXiv:0910.5311},
year = {2015}
}