Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness
arXiv:2106.14784 · doi:10.3390/e24091182
Abstract
It is often claimed that the entropy of a network's degree distribution is a proxy for its robustness. Here, we clarify the link between degree distribution entropy and giant component robustness to node removal by showing that the former merely sets a lower bound to the latter for randomly configured networks when no other network characteristics are specified. Furthermore, we show that, for networks of fixed expected degree that follow degree distributions of the same form, the degree distribution entropy is not indicative of robustness. By contrast, we show that the remaining degree entropy and robustness have a positive monotonic relationship and give an analytic expression for the remaining degree entropy of the log-normal distribution. We also show that degree-degree correlations are not by themselves indicative of a network's robustness for real networks. We propose an adjustment to how mutual information is measured which better encapsulates structural properties related to robustness.
arXiv comment13 pages, 6 figures
References in corpus (19)
- Statistical mechanics of complex networks
- Power-law distributions in empirical data
- Error and attack tolerance of complex networks
- Efficient Behavior of Small-World Networks
- Assortative mixing in networks
- Characterization of complex networks: A survey of measurements
- Resilience of the Internet to random breakdowns
- Mitigation of Malicious Attacks on Networks
- Scale-free networks are rare
- An information-theoretic framework for resolving community structure in complex networks
- A fast Monte Carlo algorithm for site or bond percolation
- Entropy measures for complex networks: Toward an information theory of complex topologies
- Classification of scale-free networks
- The entropy of network ensembles
- Entropy Optimization of Scale-Free Networks Robustness to Random Failures
- Quantifying randomness in real networks
- Efficiency of attack strategies on complex model and real-world networks
- Gibbs entropy of networks ensembles by cavity methods
- Classical Information Theory of Networks