Bond percolation on a class of correlated and clustered random graphs
From MaRDI portal
Publication:3168481
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.
Recommendations
- The percolation transition in correlated hypergraphs
- Percolation on sparse random graphs with given degree sequence
- Percolation Analysis of Clusters in Random Graphs
- Clusters' size-degree distribution for bond percolation
- Networks with degree–degree correlations are special cases of the edge-coloured random graph
Cited in
(9)- scientific article; zbMATH DE number 6385345 (Why is no real title available?)
- Networks beyond pairwise interactions: structure and dynamics
- Clusters' size-degree distribution for bond percolation
- Percolation on complex networks: theory and application
- Complex dynamics of synergistic coinfections on realistically clustered networks
- The Kuramoto model in complex networks
- The incipient giant component in bond percolation on general finite weighted graphs
- Spreading dynamics on complex networks: a general stochastic approach
- The percolation transition in correlated hypergraphs
This page was built for publication: Bond percolation on a class of correlated and clustered random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3168481)