Phase transition in random intersection graphs with communities

DOI10.1002/rsa.21063zbMath1522.05446arXiv1905.06253OpenAlexW2946180793MaRDI QIDQ6074690

Júlia Komjáthy, Remco van der Hofstad, Viktória Vadon

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.06253

zbMATH Keywords

percolationphase transitioncommunity structurerandom networksrandom intersection graphsoverlapping communitiesbipartite configuration model

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Revisiting the modularity-disease transmission link: uncovering the importance of intra-modular structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating simple random graphs with prescribed degree distribution
• Analysis of a stochastic SIR epidemic on a random network incorporating household structure
• The largest component in an inhomogeneous random intersection graph with clustering
• A note on the component structure in random intersection graphs with tunable clustering
• Connectivity of the uniform random intersection graph
• Connected components in random graphs with given expected degree sequences
• Degree and clustering coefficient in sparse random intersection graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Limit laws for self-loops and multiple edges in the configuration model
• An old approach to the giant component problem
• Data science, learning by latent structures, and knowledge discovery.
• Bipartite structure of all complex networks
• Epidemics on random intersection graphs
• Contagions in random networks with overlapping communities
• Random Graphs and Complex Networks
• Zero-One Laws for Connectivity in Inhomogeneous Random Key Graphs
• Degree-degree distribution in a power law random intersection graph with clustering
• Percolation
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• A new approach to the giant component problem
• Threshold behaviour and final outcome of an epidemic on a random network with household structure
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• Symmetric sampling procedures, general epidemic processes and their threshold limit theorems
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The final size of a nearly critical epidemic, and the first passage time of a Wiener process to a parabolic barrier
• Percolation
• Community structure in social and biological networks
• A critical point for random graphs with a given degree sequence
• Random intersection graphs with communities
• Zero–One Laws for Connectivity in Random Key Graphs
• Collective dynamics of ‘small-world’ networks
• Component Evolution in General Random Intersection Graphs
• Parameter Estimators of Sparse Random Intersection Graphs with Thinned Communities
• Networks