Network cloning unfolds the effect of clustering on dynamical processes
Ali Faqeeh, Sergey Melnik, James P. Gleeson

TL;DR
This paper introduces network L-cloning, a method to generate ensembles of networks with preserved degree distributions but reduced clustering, enabling analysis of how short loops influence dynamical processes and the accuracy of tree-based theories.
Contribution
The paper presents a novel network cloning technique that preserves degree distributions while systematically reducing clustering, facilitating the study of loop effects on network dynamics.
Findings
Dynamics on L-cloned networks are well-described by tree-based theories for large L.
Short loops significantly affect the accuracy of certain dynamical models.
L-cloning allows controlled investigation of loop effects in complex networks.
Abstract
We introduce network -cloning, a technique for creating ensembles of random networks from any given real-world or artificial network. Each member of the ensemble is an -cloned network constructed from copies of the original network. The degree distribution of an -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 \LC network, and hence its clustering coefficient, is reduced by a factor of compared to those of the original network. Furthermore, the density of loops of any fixed length approaches zero for sufficiently large values of . Other variants of -cloning allow us to keep intact the short loops of certain lengths. As an application, we employ these network cloning methods to investigate the effect of short loops on dynamical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
