Nonmonotonic percolation threshold in correlated networks and hypergraphs

Abstract

We study the effect of assortative and disassortative mixing on the robustness of networks under random node failures. For ordinary (dyadic) networks, by using the generating function technique and stochastic simulations, we show that the relationship between the Pearson assortativity coefficient $r$ and the percolation threshold $p_c$ is not always monotonic. More specifically, in certain regions of the parameter space of our model, moderately disassortative networks can be more fragile than either strongly disassortative or uncorrelated networks. We observe this nonmonotonic behavior for trimodal networks as well as for networks with Poisson and power-law degree distributions. We then extend our analysis to hypergraphs with correlations between node hyperdegree and hyperedge cardinality. For this case, we find that positively correlated hypergraphs tend to be more fragile than negatively correlated ones. Additionally, as in the dyadic case, the relationship between $r$ and $p_c$ is nonmonotonic, and the most fragile configuration does not correspond to the most assortative hypergraph.

Code: https://github.com/LDVal/NonMonotonicCorr

References in corpus (11)

• The physics of higher-order interactions in complex systems
• Robustness and resilience of complex networks
• Percolation on complex networks: Theory and application
• Percolation on correlated networks
• Percolation transition in networks with degree-degree correlation
• The effects of degree correlations on network topologies and robustness
• Synchronization in Scale Free networks with degree correlation
• Robustness analysis of bimodal networks in the whole range of degree correlation
• Degree correlations in graphs with clique clustering
• Robustness of correlated networks against propagating attacks
• Connected components in networks with higher-order interactions