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 two 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 behaviours of the size and composition of the components (small and giant) in a synthetic, albeit realistic, social network.
 Publication:

Journal of Physics A Mathematical General
 Pub Date:
 October 2012
 DOI:
 10.1088/17518113/45/40/405005
 arXiv:
 arXiv:1201.4602
 Bibcode:
 2012JPhA...45N5005A
 Keywords:

 Condensed Matter  Statistical Mechanics;
 Computer Science  Social and Information Networks;
 Physics  Physics and Society;
 Quantitative Biology  Populations and Evolution
 EPrint:
 16 pages and 4 figures