Random intersection graphs with communities
From MaRDI portal
Publication:5013247
Abstract: Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model. Conditionally on the group memberships, the classical random intersection graph is obtained by connecting individuals when they are together in at least one group. We generalize this definition, allowing for arbitrary community structures within the groups. In our new model, groups might overlap and they have their own internal structure described by a graph, the classical setting corresponding to groups being complete graphs. Our model turns out to be tractable. We analyze the overlapping structure of the communities, derive the asymptotic degree distribution and the local clustering coefficient. These proofs rely on local weak convergence, which also implies that subgraph counts converge. We further exploit the connection to the bipartite configuration model, for which we also prove local weak convergence, and which is interesting in its own right.
Recommendations
Cites work
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Analysis of a stochastic SIR epidemic on a random network incorporating household structure
- Assortativity and clustering of sparse random intersection graphs
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Bipartite structure of all complex networks
- Community structure in social and biological networks
- Component evolution in general random intersection graphs
- Connectivity of the uniform random intersection graph
- Contagions in random networks with overlapping communities
- Degree and clustering coefficient in sparse random intersection graphs
- Degree distribution of an inhomogeneous random intersection graph
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Directed random graphs with given degree distributions
- Generating simple random graphs with prescribed degree distribution
- Local weak convergence for PageRank
- Mesoscopic scales in hierarchical configuration models
- Networks. An introduction.
- On Random Intersection Graphs: The Subgraph Problem
- On a conditionally Poissonian graph process
- Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- Random graph dynamics
- Random graphs and complex networks. Volume 1
- Random graphs.
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Recurrence of distributional limits of finite planar graphs
- The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
- Threshold behaviour and final outcome of an epidemic on a random network with household structure
- Unimodular random trees
Cited in
(8)- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- Phase transition in random intersection graphs with communities
- Recognizing random intersection graphs
- Clique and cycle frequencies in a sparse random graph model with overlapping communities
- Hyperbolicity, degeneracy, and expansion of random intersection graphs
- Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
- Building a random network with a given expected giant component
- Self-similarity of communities of the ABCD model
This page was built for publication: Random intersection graphs with communities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013247)
