The Largest Component of Near-Critical Random Intersection Graph with Tunable Clustering
In this paper, we study the largest component of the near-critical random intersection graph Gn,m,p with n nodes and m elements, where m=Θn which leads to the fact that the clustering is tunable. We prove that with high probability the size of the largest component in the weakly supercritical random...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Hindawi Limited
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/6faab08876ff4a399700cf6c323a9921 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|