Critical scaling limit of the random intersection graph -- POSTPONED TO NEXT TERM

Status: This talk is in preparation - details may change
Status: This talk has been cancelled

In this talk, we prove a scaling limit for the size (both in terms of vertices and edges) of the largest components of a critical random intersection graph in which each individual is assigned to each community with a uniform probability p, all independently of each other. We show that the order of magnitude of the largest component depends significantly on the asymptotic behaviour of the ratio between the number of individuals and communities, while the limit random variables to which component sizes converge after rescaling are the same as in the Erdos-Renyi Random Graph. We further discuss how this result relates to the known scaling limits of critical inhomogeneous random graphs.