Size of the largest component in a critical graph (Q2298120)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7170492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Size of the largest component in a critical graph |
scientific article; zbMATH DE number 7170492 |
Statements
Size of the largest component in a critical graph (English)
0 references
20 February 2020
0 references
Summary: 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 \left(n, \left[n^{5 / 3}\right], p\right)\) is asymptotically of order \(n^{2 / 3}\) and the width of scaling window is \(n^{- 1 / 3}\).
0 references
0 references
0.9277602434158324
0 references
0.8538535237312317
0 references
0.8219132423400879
0 references
0.8133142590522766
0 references
0.8119242787361145
0 references
