Effect of degree correlations above the first shell on the percolation transition

Abstract

The use of degree-degree correlations to model realistic networks which are characterized by their Pearson's coefficient, has become widespread. However the effect on how different correlation algorithms produce different results on processes on top of them, has not yet been discussed. In this letter, using different correlation algorithms to generate assortative networks, we show that for very assortative networks the behavior of the main observables in percolation processes depends on the algorithm used to build the network. The different alghoritms used here introduce different inner structures that are missed in Pearson's coefficient. We explain the different behaviors through a generalization of Pearson's coefficient that allows to study the correlations at chemical distances l from a root node. We apply our findings to real networks.

In press EPL

References in corpus (17)

• Critical phenomena in complex networks
• Efficient Immunization Strategies for Computer Networks and Populations
• Mitigation of Malicious Attacks on Networks
• Predicting the size and probability of epidemics in a population with heterogeneous infectiousness and susceptibility
• Structure of shells in complex networks
• How to make a fragile network robust and vice versa
• Onion structure and network robustness
• Synchronization in weighed scale-free networks with degree-degree correlation
• Percolation transition in networks with degree-degree correlation
• Zero Pearson Coefficient for Strongly Correlated Growing Trees
• Fundamental statistical features and self-similar properties of tagged networks
• Distance-d covering problems in scale-free networks with degree correlations
• Biased Percolation on Scale-free Networks
• Numerical evaluation of the upper critical dimension of percolation in scale-free networks
• Optimizing transport efficiency on scale-free networks through assortative or dissortative topology
• Percolation and Loop Statistics in Complex Networks
• Jamming in complex networks with degree correlation

Cited by in corpus (11)

• Percolation on complex networks: Theory and application
• Epidemic Model with Isolation in Multilayer Networks
• Social distancing strategies against disease spreading
• Analysis and perturbation of degree correlation in complex networks
• Interacting social processes on interconnected networks
• Robustness of correlated networks against propagating attacks
• Synergistic epidemic spreading in correlated networks
• Percolation on a maximally disassortative network
• Revisiting finite size effect of percolation in degree correlated networks
• Nonmonotonic percolation threshold in correlated networks and hypergraphs
• Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs