Bond percolation on a class of correlated and clustered random graphs

Abstract

We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via different types of hyperedges, edges that can link more than 2 nodes. We argue that the multitype approach coupled with the use of clustered hyperedges can reproduce a wide spectrum of complex patterns, and thus enhances our capability to model real complex networks. As an illustration of this claim, we use our formalism to highlight unusual behaviors of the size and composition of the components (small and giant) in a synthetic, albeit realistic, social network.

16 pages and 4 figures

References in corpus (12)

• Critical phenomena in complex networks
• Robustness of interdependent networks under targeted attack
• Random graphs with clustering
• Random hypergraphs and their applications
• Random graphs containing arbitrary distributions of subgraphs
• Percolation and Epidemic Thresholds in Clustered Networks
• Clustering in complex networks. I. General formalism
• Clustering in complex networks. II. Percolation properties
• Percolation on interacting networks
• Bond percolation on a class of clustered random networks
• Component sizes in networks with arbitrary degree distributions
• Exact solution of bond percolation on small arbitrary graphs

Cited by in corpus (18)

• Multilayer Networks
• Networks beyond pairwise interactions: structure and dynamics
• The Kuramoto model in complex networks
• Percolation on complex networks: Theory and application
• Global efficiency of local immunization on complex networks
• Deciphering the global organization of clustering in real complex networks
• General and exact approach to percolation on random graphs
• Smeared phase transitions in percolation on real complex networks
• Information Propagation in Clustered Multilayer Networks
• Percolation on random networks with arbitrary k-core structure
• Ising model in clustered scale-free networks
• Epidemic control in networks with cliques
• Predicting the diversity of early epidemic spread on networks
• Epidemics on contact networks: a general stochastic approach
• Coexistence of phases and the observability of random graphs
• A shadowing problem in the detection of overlapping communities: lifting the resolution limit through a cascading procedure
• Exact analytical solution of irreversible binary dynamics on networks
• Non-Thermal Transitions in n-th Order Moral Decisions