The Largest Component of Near-Critical Random Intersection Graph with Tunable Clustering

Shiying Huang, Bin Wang and Barbara Martinucci

Journal of Mathematics, 2021, vol. 2021, 1-12

Abstract: 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 intersection graph with tunable clustering on n vertices is of order nϵn, and it is of order ϵ−2nlognϵ3n in the weakly subcritical one, where ϵn⟶0 and n1/3ϵn⟶∞ as n⟶∞.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/2284300.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/2284300.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2284300

DOI: 10.1155/2021/2284300

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().