Random intersection graphs with communities
From MaRDI portal
Publication:5013247
DOI10.1017/apr.2021.12zbMath1475.60024arXiv1809.02514OpenAlexW3214797309MaRDI QIDQ5013247
Viktória Vadon, Remco van der Hofstad, Júlia Komjáthy
Publication date: 29 November 2021
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.02514
community structurelocal weak convergencerandom networksrandom intersection graphsoverlapping communities
Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Assortativity and clustering of sparse random intersection graphs
- Degree distribution of an inhomogeneous random intersection graph
- Generating simple random graphs with prescribed degree distribution
- Analysis of a stochastic SIR epidemic on a random network incorporating household structure
- Connectivity of the uniform random intersection graph
- Mesoscopic scales in hierarchical configuration models
- Recurrence of distributional limits of finite planar graphs
- Degree and clustering coefficient in sparse random intersection graphs
- Local weak convergence for PageRank
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Bipartite structure of all complex networks
- Asymptotic behavior and distributional limits of preferential attachment graphs
- The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
- Contagions in random networks with overlapping communities
- Random Graphs and Complex Networks
- Degree-degree distribution in a power law random intersection graph with clustering
- Threshold behaviour and final outcome of an epidemic on a random network with household structure
- RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
- On Random Intersection Graphs: The Subgraph Problem
- Community structure in social and biological networks
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Directed random graphs with given degree distributions
- Unimodular random trees
- Component Evolution in General Random Intersection Graphs
- On a conditionally Poissonian graph process
- Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
- Networks