Structure of percolating clusters in random clustered networks

Abstract

We examine the structure of the percolating cluster (PC) formed by site percolation on a random clustered network (RCN) model. Using the generating functions, we formulate the clustering coefficient and assortative coefficient of the PC. We analytically and numerically show that the PC in the highly clustered networks is clustered even at the percolation threshold. The assortativity of the PC depends on the details of the RCN. The PC at the percolation threshold is disassortative when the numbers of edges and triangles of each node are assigned by Poisson distributions, but assortative when each node in an RCN has the same small number of edges, most of which form triangles. This result seemingly contradicts the disassortativity of fractal networks, although the renormalization scheme unveils the disassortative nature of a fractal PC.

arXiv comment15 pages, 10 figures

References in corpus (22)

• Epidemic processes in complex networks
• Critical phenomena in complex networks
• Self-similarity of complex networks
• Origins of fractality in the growth of complex networks
• A fast Monte Carlo algorithm for site or bond percolation
• Random graphs with clustering
• How to calculate the fractal dimension of a complex network: the box covering algorithm
• Skeleton and fractal scaling in complex networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Quantifying randomness in real networks
• How clustering affects the bond percolation threshold in complex networks
• Scale-free trees: the skeletons of complex networks
• Self-similar Scale-free Networks and Disassortativity
• Correlations in connected random graphs
• Disassortativity of percolating clusters in random networks
• Revealing the Micro-Structure of the Giant Component in Random Graph Ensembles
• Quantifying long-range correlations in complex networks beyond nearest neighbors
• Fractality and degree correlations in scale-free networks
• A general formulation of long-range degree correlations in complex networks
• Statistical analysis of articulation points in configuration model networks
• Generating random networks that consist of a single connected component with a given degree distribution
• Disassortativity of random critical branching trees

Cited by in corpus (7)

• Two-pathogen model with competition on clustered networks
• Cooperative coinfection dynamics on clustered networks
• Degree correlations in graphs with clique clustering
• Symbiotic and antagonistic disease dynamics on networks using bond percolatio
• Belief propagation on networks with cliques and chordless cycles
• Emergence of Long-Range Correlations in Random Networks
• Observability transitions in clustered networks