Statistical analysis of edges and bredges in configuration model networks

Abstract

A bredge (bridge-edge) is an edge whose deletion would split the network component on which it resides into two components. Bredges are vulnerable links that play an important role in network collapse processes, which may result from node or link failures, attacks or epidemics. Therefore, the abundance and properties of bredges affect the resilience of the network. We present analytical results for the statistical properties of bredges in configuration model networks. Using a generating function approach based on the cavity method, we calculate the probability $\hat{P}(e\in \mathrm{B})$ that a random edge e in a configuration model network with degree distribution P(k) is a bredge (B). We also calculate the joint degree distribution $\hat{P}(k,k^{\prime }|\mathrm{B})$ of the end-nodes of a random bredge. We examine the distinct properties of bredges on the giant component (GC) and on the finite tree components (FC) of the network. On the finite components all the edges are bredges and there are no degree-degree correlations. We calculate the probability $\hat{P}(e\in \mathrm{B}|\mathrm{GC})$ that a random edge on the giant component is a bredge. We also calculate the joint degree distribution $\hat{P}(k,k^{\prime }|\mathrm{B},\mathrm{GC})$ of the end-nodes of bredges and the joint degree distribution $\hat{P}(k,k^{\prime }|\mathrm{NB},\mathrm{GC})$ of the end-nodes of non-bredge (NB) edges on the giant component. Surprisingly, it is found that the degrees k and k' of the end-nodes of bredges are correlated, while the degrees of the end-nodes of NB edges are uncorrelated. We thus conclude that all the degree-degree correlations on the giant component are concentrated on the bredges. We calculate the covariance of end-nodes of bredges and show it is negative, namely bredges tend to connect high degree nodes to low degree nodes. The implications of the results are discussed in the context of common attack scenarios and dismantling processes.

27 pages, 14 figures. arXiv admin note: text overlap with arXiv:1806.04591

References in corpus (10)

• Mitigation of Malicious Attacks on Networks
• The entropic origin of disassortativity in complex networks
• Articulation Points in Complex Networks
• Component sizes in networks with arbitrary degree distributions
• Bicomponents and the robustness of networks to failure
• Distance distribution in random graphs and application to networks exploration
• The cavity method at zero temperature
• The distribution of shortest path lengths in a class of node duplication network models
• Distribution of shortest cycle lengths in random networks
• Distance Distribution in Extreme Modular Networks

Cited by in corpus (2)

• The Fate of Articulation Points and Bredges in Percolation
• The distribution of shortest path lengths on trees of a given size in subcritical Erdos-Renyi networks