Open AccessSize of the Largest Component in a Critical Graph
Author(s) -
Bin Wang,
Lang Zou
Publication year - 2019
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2019/1731802
Subject(s) - algorithm , computer science
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 G n ,n 5 / 3, pis asymptotically of ordern 2 / 3and the width of scaling window isn − 1 / 3.