Random graphs with arbitrary clustering and their applications
MetadataShow full item record
The structure of many real networks is not locally treelike and, hence, network analysis fails to characterize their bond percolation properties. In a recent paper [P. Mann, V. A. Smith, J. B. O. Mitchell, and S. Dobson, arXiv:2006.06744], we developed analytical solutions to the percolation properties of random networks with homogeneous clustering (clusters whose nodes are degree equivalent). In this paper, we extend this model to investigate networks that contain clusters whose nodes are not degree equivalent, including multilayer networks. Through numerical examples, we show how this method can be used to investigate the properties of random complex networks with arbitrary clustering, extending the applicability of the configuration model and generating function formulation.
Mann , P S , Smith , V A , Mitchell , J B O & Dobson , S A 2021 , ' Random graphs with arbitrary clustering and their applications ' , Physical Review. E, Statistical, nonlinear, and soft matter physics , vol. 103 , no. 1 , 012309 . https://doi.org/10.1103/PhysRevE.103.012309
Physical Review. E, Statistical, nonlinear, and soft matter physics
Copyright © 2021 American Physical Society. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the final published version of the work, which was originally published at https://doi.org/10.1103/PhysRevE.103.012309.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.