Size of the Largest Component in a Critical Graph
Keyword(s):
In this paper, by the branching process and the martingale method, we prove that the size of the largest component in the critical random intersection graph Gn,n5/3,p is asymptotically of order n2/3 and the width of scaling window is n−1/3.
2008 ◽
Vol 45
(03)
◽
pp. 743-756
◽
2008 ◽
Vol 45
(3)
◽
pp. 743-756
◽
2011 ◽
Vol 2011
◽
pp. 1-9
◽
2018 ◽
Vol 52
(4)
◽
pp. 662-679
◽