Equivalence of the random intersection graph and G(n,p)
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 m >= n3 and a graph in which each edge appears independently. Moreover we prove sharper equivalence results under some additional assumptions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.