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.

arXiv commentCode: https://github.com/LDVal/NonMonotonicCorr

References in corpus (25)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Assortative mixing in networks
• Random graphs with arbitrary degree distributions and their applications
• Mixing patterns in networks
• Network robustness and fragility: Percolation on random graphs
• The physics of higher-order interactions in complex systems
• Robustness and resilience of complex networks
• Percolation on complex networks: Theory and application
• Resilience to damage of graphs with degree correlations
• Social contagion models on hypergraphs
• Percolation on correlated networks
• Percolation transition in networks with degree-degree correlation
• Zero Pearson Coefficient for Strongly Correlated Growing Trees
• The theory of percolation on hypergraphs
• Impact of network assortativity on epidemic and vaccination behaviour
• Hypergraph assortativity: a dynamical systems perspective
• The effects of degree correlations on network topologies and robustness
• Lower bound of assortativity coefficient in scale-free networks
• Effect of degree correlations above the first shell on the percolation transition
• Synchronization in Scale Free networks with degree correlation
• Robustness analysis of bimodal networks in the whole range of degree correlation
• Robustness of correlated networks against propagating attacks
• Degree correlations in graphs with clique clustering
• Connected components in networks with higher-order interactions