Equivalence of the random intersection graph and G(n,p)

Details Equivalence of the random intersection graph and G(n,p) Equivalence of the random intersection graph and G(n,p)

2009-10-28

arxiv.org/abs/0910.5311v1

Random Structures and Algorithms, 38, 205-234, 2011

Mathematics

Combinatorics

Scientific paper

10.1002/rsa.20356

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 >= n^3$ and a graph in which each edge appears
independently. Moreover we prove sharper equivalence results under some
additional assumptions.

Affiliated with

Also associated with

No associations

Rating

Equivalence of the random intersection graph and G(n,p) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Equivalence of the random intersection graph and G(n,p), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equivalence of the random intersection graph and G(n,p) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-718174