We introduce network L-cloning, a novel technique for creating ensembles of
random networks from any given real-world or artificial network. Each member of
the ensemble is an "L-cloned network" constructed from L copies of the original
network. The degree distribution of an L-cloned network and, more importantly,
the degree-degree correlation between and beyond nearest neighbors are
identical to those of the original network. The density of triangles in an
L-cloned network, and hence its clustering coefficient, are reduced by a factor
of L comparing to those of the original network. Furthermore, the density of
loops of any fixed length approaches zero for sufficiently large values of L.
As an application, we employ L-cloning to investigate the effect of short loops
on dynamical processes running on networks and to inspect the accuracy of
corresponding tree-based theories. We demonstrate that dynamics on L-cloned
networks (with sufficiently large L) are accurately described by the so-called
ädjacency tree-based theories", which is a class of theoretical approaches for
modeling various networked behaviors including percolation, SI epidemic
spreading, and the Ising model.
%0 Journal Article
%1 Faqeeh2015Network
%A Faqeeh, Ali
%A Melnik, Sergey
%A Gleeson, James P.
%D 2015
%J Physical Review E
%K null-models information-diffusion clustering
%N 5
%R 10.1103/PhysRevE.91.052807
%T Network cloning unfolds the effect of clustering on dynamical processes
%U http://dx.doi.org/10.1103/PhysRevE.91.052807
%V 91
%X We introduce network L-cloning, a novel technique for creating ensembles of
random networks from any given real-world or artificial network. Each member of
the ensemble is an "L-cloned network" constructed from L copies of the original
network. The degree distribution of an L-cloned network and, more importantly,
the degree-degree correlation between and beyond nearest neighbors are
identical to those of the original network. The density of triangles in an
L-cloned network, and hence its clustering coefficient, are reduced by a factor
of L comparing to those of the original network. Furthermore, the density of
loops of any fixed length approaches zero for sufficiently large values of L.
As an application, we employ L-cloning to investigate the effect of short loops
on dynamical processes running on networks and to inspect the accuracy of
corresponding tree-based theories. We demonstrate that dynamics on L-cloned
networks (with sufficiently large L) are accurately described by the so-called
ädjacency tree-based theories", which is a class of theoretical approaches for
modeling various networked behaviors including percolation, SI epidemic
spreading, and the Ising model.
@article{Faqeeh2015Network,
abstract = {{We introduce network L-cloning, a novel technique for creating ensembles of
random networks from any given real-world or artificial network. Each member of
the ensemble is an "L-cloned network" constructed from L copies of the original
network. The degree distribution of an L-cloned network and, more importantly,
the degree-degree correlation between and beyond nearest neighbors are
identical to those of the original network. The density of triangles in an
L-cloned network, and hence its clustering coefficient, are reduced by a factor
of L comparing to those of the original network. Furthermore, the density of
loops of any fixed length approaches zero for sufficiently large values of L.
As an application, we employ L-cloning to investigate the effect of short loops
on dynamical processes running on networks and to inspect the accuracy of
corresponding tree-based theories. We demonstrate that dynamics on L-cloned
networks (with sufficiently large L) are accurately described by the so-called
"adjacency tree-based theories", which is a class of theoretical approaches for
modeling various networked behaviors including percolation, SI epidemic
spreading, and the Ising model.}},
added-at = {2019-06-10T14:53:09.000+0200},
archiveprefix = {arXiv},
author = {Faqeeh, Ali and Melnik, Sergey and Gleeson, James P.},
biburl = {https://www.bibsonomy.org/bibtex/2722035c9170fc4f72c2d6a68688aec8c/nonancourt},
citeulike-article-id = {13331940},
citeulike-linkout-0 = {http://dx.doi.org/10.1103/PhysRevE.91.052807},
citeulike-linkout-1 = {http://arxiv.org/abs/1408.1294},
citeulike-linkout-2 = {http://arxiv.org/pdf/1408.1294},
day = 14,
doi = {10.1103/PhysRevE.91.052807},
eprint = {1408.1294},
interhash = {11799216f8c44db79a83b271fff0086f},
intrahash = {722035c9170fc4f72c2d6a68688aec8c},
issn = {1550-2376},
journal = {Physical Review E},
keywords = {null-models information-diffusion clustering},
month = may,
number = 5,
posted-at = {2014-08-21 15:33:34},
priority = {2},
timestamp = {2019-08-01T16:10:21.000+0200},
title = {{Network cloning unfolds the effect of clustering on dynamical processes}},
url = {http://dx.doi.org/10.1103/PhysRevE.91.052807},
volume = 91,
year = 2015
}