Robustness analysis of bimodal networks in the whole range of degree correlation

Abstract

We present exact analysis of the physical properties of bimodal networks specified by the two peak degree distribution fully incorporating the degree-degree correlation between node connection. The structure of the correlated bimodal network is uniquely determined by the Pearson coefficient of the degree correlation, keeping its degree distribution fixed. The percolation threshold and the giant component fraction of the correlated bimodal network are analytically calculated in the whole range of the Pearson coefficient from $-1$ to $1$ against two major types of node removal, which are the random failure and the degree-based targeted attack. The Pearson coefficient for next-nearest-neighbor pairs is also calculated, which always takes a positive value even when the correlation between nearest-neighbor pairs is negative. From the results, it is confirmed that the percolation threshold is a monotonically decreasing function of the Pearson coefficient for the degrees of nearest-neighbor pairs increasing from $-1$ and $1$ regardless of the types of node removal. In contrast, the node fraction of the giant component for bimodal networks with positive degree correlation rapidly decreases in the early stage of random failure, while that for bimodal networks with negative degree correlation remains relatively large until the removed node fraction reaches the threshold. In this sense, bimodal networks with negative degree correlation are more robust against random failure than those with positive degree correlation.

arXiv comment8 pages, 7 figures

References in corpus (17)

• Assortative mixing in networks
• Mixing patterns in networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Breakdown of the Internet under intentional attack
• Mitigation of Malicious Attacks on Networks
• Resilience to damage of graphs with degree correlations
• Optimization of Robustness of Complex Networks
• Optimization of Network Robustness to Waves of Targeted and Random Attack
• Percolation on correlated networks
• Two-Peak and Three-Peak Optimal Complex Networks
• Robustness of onion-like correlated networks against targeted attacks
• Uncovering disassortativity in large scale-free networks
• Degree-degree correlations in random graphs with heavy-tailed degrees
• Percolation transition in networks with degree-degree correlation
• Optimization of Network Robustness to Random Breakdowns
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations

Cited by in corpus (3)

• Synergistic epidemic spreading in correlated networks
• Robustness of Random Networks with Selective Reinforcement against Attacks
• Nonmonotonic percolation threshold in correlated networks and hypergraphs