Component sizes of rank-2 multiplicative random graphs

Abstract

We show that in three different critical regimes, the masses of the connected components of rank-2 multiplicative random graph converge to lengths of excursions of a thinned L\'evy process, perhaps with random coefficients. The three critical regimes are those identified by Bollob\'as, Janson and Riordan (2007), the interacting regime identified by Konarovskyi and Limic (2021), and what we call the nearly bipartite regime which has recently gained interest for its connection to random intersection graphs. Our results are able to extend some of the results by Baslingker et al. (2023) on component sizes of the stochastic blockmodel with two types and those of Federico (2019) and Wang (2023) on the sizes of the connected components of random intersection graphs.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…