Critical scaling limits of the random intersection graph
arXiv:1910.13227
Abstract
We analyse the scaling limit of the sizes of the largest components of the Random Intersection Graph close to the critical point , when the numbers of individuals and of communities have different orders of magnitude. We find out that if , then the scaling limit is identical to the one of the \ER Random Graph (ERRG), while if the critical exponent is similar to that of Inhomogeneous Random Graphs with heavy-tailed degree distributions, yet the rescaled component sizes have the same limit in distribution as in the ERRG. This suggests the existence of a wide universality class of inhomogeneous random graph models such that in the critical window the largest components have sizes of order for some , which depends on some parameter of the graph.
arXiv comment30 pages, no figures
References in corpus (8)
- Community structure in social and biological networks
- Hyperbolic Geometry of Complex Networks
- Clustering implies geometry in networks
- Critical window for the configuration model: finite third moment degrees
- Assortativity and clustering of sparse random intersection graphs
- Heavy-tailed configuration models at criticality
- Universality for critical heavy-tailed network models: Metric structure of maximal components
- Random intersection graphs with communities