A Note on the Component Structure in Random Intersection Graphs with Tunable Clustering
Keyword(s):
We study the component structure in random intersection graphs with tunable clustering, and show that the average degree works as a threshold for a phase transition for the size of the largest component. That is, if the expected degree is less than one, the size of the largest component is a.a.s. of logarithmic order, but if the average degree is greater than one, a.a.s. a single large component of linear order emerges, and the size of the second largest component is at most of logarithmic order.
2016 ◽
Vol 26
(3)
◽
pp. 338-366
◽
Keyword(s):
1995 ◽
Vol 53
◽
pp. 502-503
1992 ◽
Vol 50
(1)
◽
pp. 432-433
1990 ◽
Vol 48
(4)
◽
pp. 172-173
1993 ◽
Vol 51
◽
pp. 890-891
1998 ◽
Vol 184-185
(1-2)
◽
pp. 1057-1060
1982 ◽
Vol 85
(1)
◽
pp. 297-303
◽