4 papers · 1 filter
Asymptotics for the number of bipartite graphs with fixed surplus
David Clancy
In a recent work on the bipartite ErdÅs-Rényi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use so…
Near-critical bipartite configuration models and their associated intersection graphs
David Clancy
Recently, van der Hofstad, Komjáthy, and Vadon (2022) identified the critical point for the emergence of a giant connected component for the bipartite configuration model (BCM) an…
Component sizes of rank-2 multiplicative random graphs
David Clancy
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évy…
Degree corrected stochastic block model: excursion representation
David Clancy, Vitalii Konarovskyi, Vlada Limic
This is the first of two complementary works in which we analyze the connected components of the degree-corrected stochastic block model (DCSBM). Our model is a random graph with a…