Size of the Largest Component in a Critical Graph
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2019-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2019/1731802 |