Bond percolation on a class of correlated and clustered random graphs

Abstract

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