Authors: B. Wang, L. Wang, K. Xiang Title: The largest component in critical graphs Source: Discussiones Mathematicae Graph Theory Received 08.04.2016, Revised 06.03.2017, Accepted 07.03.2017, doi: 10.7151/dmgt.2052 | |
Abstract: In this paper, through the coupling and martingale method, we prove the order of the largest component in some critical random intersection graphs is n^{\frac{2}{3}} with high probability and the width of scaling window around the critical probability is n^{-\frac{1}{3}}; while in some graphs, the order of the largest component and the width of the scaling window around the critical probability depend on the parameters in the corresponding definition of random intersection graphs. Our results show that there is still an ``inside" phase transition in critical random intersection graphs. | |
Keywords: critical random intersection graph, largest component, scaling window | |
Links: |