Random intersection graphs with communities
More Info
expand_more
expand_more
Abstract
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of communities and individuals, where these communities may overlap. We generalize the model, allowing for arbitrary community structures within the communities. In our new model, communities may overlap, and they have their own internal structure described by arbitrary finite community graphs. Our model turns out to be tractable. We analyze the overlapping structure of the communities, show local weak convergence (including convergence of subgraph counts), and derive the asymptotic degree distribution and the local clustering coefficient.
Files
Random_intersection_graphs_wit... (pdf)
(pdf | 0.852 Mb)
Unknown license
Download not available