Disassortativity of percolating clusters in random networks

Abstract

We provide arguments for the property of the degree-degree correlations of giant components formed by the percolation process on uncorrelated random networks. Using the generating functions, we derive a general expression for the assortativity of a giant component, $r$, which is defined as Pearson's correlation coefficient for degrees of directly connected nodes. For uncorrelated random networks in which the third moment for the degree distribution is finite, we prove the following two points. (1) Assortativity $r$ satisfies the relation $r\le 0$ for $p\ge p_{\mathrm{c}}$. (2) The average degree of nodes adjacent to degree-$k$ nodes at the percolation threshold is proportional to $k^{-1}$ independently of the degree distribution function. These results claim that disassortativity emerges in giant components near the percolation threshold. The accuracy of the analytical treatment is confirmed by extensive Monte Carlo simulations.

arXiv comment10 pages, 5 figures

References in corpus (17)

• Statistical mechanics of complex networks
• Assortative mixing in networks
• Epidemic processes in complex networks
• Random graphs with arbitrary degree distributions and their applications
• Synchronization in complex networks
• Mixing patterns in networks
• Resilience of the Internet to random breakdowns
• A fast Monte Carlo algorithm for site or bond percolation
• Percolation on correlated networks
• Uncovering disassortativity in large scale-free networks
• Degree-degree correlations in random graphs with heavy-tailed degrees
• Self-similar Scale-free Networks and Disassortativity
• Correlations in connected random graphs
• Dynamics on Modular Networks with Heterogeneous Correlations
• Revealing the Micro-Structure of the Giant Component in Random Graph Ensembles
• Correlations in complex networks under attack
• Fractality and degree correlations in scale-free networks

Cited by in corpus (7)

• Structure of percolating clusters in random clustered networks
• Bond percolation between $k$ separated points on a square lattice
• Statistical analysis of edges and bredges in configuration model networks
• Degree correlations in graphs with clique clustering
• Sampling networks by nodal attributes
• Emergence of Long-Range Correlations in Random Networks
• Generating random networks that consist of a single connected component with a given degree distribution