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 fictional, albeit
realistic, social network.
%0 Journal Article
%1 Allard2012Bond
%A Allard, A.
%A Hébert-Dufresne, L.
%A Noël, P-A
%A Marceau, V.
%A Dubé, L. J.
%D 2012
%J Journal of Physics A: Mathematical and Theoretical
%K clustering bond-percolation
%N 40
%P 405005+
%R 10.1088/1751-8113/45/40/405005
%T Bond percolation on a class of correlated and clustered random graphs
%U http://dx.doi.org/10.1088/1751-8113/45/40/405005
%V 45
%X 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 fictional, albeit
realistic, social network.
@article{Allard2012Bond,
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 fictional, albeit
realistic, social network.}},
added-at = {2019-06-10T14:53:09.000+0200},
archiveprefix = {arXiv},
author = {Allard, A. and H\'{e}bert-Dufresne, L. and No\"{e}l, P-A and Marceau, V. and Dub\'{e}, L. J.},
biburl = {https://www.bibsonomy.org/bibtex/20604eaf2ea6e186333b3cf4de7eb84a8/nonancourt},
citeulike-article-id = {10264138},
citeulike-linkout-0 = {http://dx.doi.org/10.1088/1751-8113/45/40/405005},
citeulike-linkout-1 = {http://arxiv.org/abs/1201.4602},
citeulike-linkout-2 = {http://arxiv.org/pdf/1201.4602},
day = 12,
doi = {10.1088/1751-8113/45/40/405005},
eprint = {1201.4602},
interhash = {29c90425e7efe3ea31cbbf071231db5f},
intrahash = {0604eaf2ea6e186333b3cf4de7eb84a8},
issn = {1751-8121},
journal = {Journal of Physics A: Mathematical and Theoretical},
keywords = {clustering bond-percolation},
month = oct,
number = 40,
pages = {405005+},
posted-at = {2012-01-26 11:02:13},
priority = {2},
timestamp = {2019-08-23T11:01:11.000+0200},
title = {{Bond percolation on a class of correlated and clustered random graphs}},
url = {http://dx.doi.org/10.1088/1751-8113/45/40/405005},
volume = 45,
year = 2012
}