{'fraction_non_alphanumeric': 0.03198157861072023, 'fraction_numerical': 0.007547652552129973, 'mean_word_length': 5.032021604938271, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Geometric correlations mitigate the extreme vulnerability of multiplex networks against targeted attacks

We show that real multiplex networks are unexpectedly robust against targeted attacks on high degree nodes, and that hidden interlayer geometric correlations predict this robustness. Without geometric correlations, multiplexes exhibit an abrupt breakdown of mutual connectivity, even with interlayer degree correlations. With geometric correlations, we instead observe a multistep cascading process leading into a continuous transition, which apparently becomes fully continuous in the thermodynamic limit. Our results are important for the design of efficient protection strategies and of robust interacting networks in many domains.

Networks are ubiquitous in many domains of science and engineering, ranging from ecology to economics, and often form critical infrastructures, like the Internet and financial systems. Nowadays, these systems are increasingly interdependent [1] and form so-called multiplex or multilayer networks [2,3]. This interdependency implies that, if a node fails in one network layer, its counterparts in the other layers also fail simultaneously. This process can continue back and forth between the layers, which makes them especially vulnerable to failures. In particular, an abrupt transition can arise in mutual percolation when nodes are removed at random [3][4][5]. Interestingly, interlayer degree correlations [6][7][8][9] mitigate this vulnerability to random node removals and the transition becomes continuous [10,11].
In real systems, failures may not always be random but, instead, the result of targeted attacks. Multiplexes are extremely vulnerable to them on high-degree nodes [12][13][14], and exhibit a discontinuous phase transition even in the presence of interlayer degree correlations [13]. Although it is highly important for many real systems, it is not well understood how this vulnerability can be mitigated. Previous results point to negative interlayer degree correlations as a mitigation factor [13], but real systems tend to show positive instead of negative interlayer degree correlations [6]. Are there other structural features that render multiplex networks robust against targeted attacks? And most importantly, are these properties present in real multiplexes?
Here, we show that interlayer hidden geometric correlations [15] mitigate the vulnerability of multiplexes to targeted attacks. The removal of the highest degree nodes triggers multiple cascades which do not destroy the system completely, but eventually lead into a continuous percolation transition. Strikingly, we show that the strength of these geometric correlations in real systems is a good predictor of their robustness.
More specifically, we consider targeted attacks in twolayer multiplexes, where nodes are removed in decreasing order of their degrees among both layers. We rank all nodes i according to denotes the degree of node i in layer j = 1, 2. We remove nodes with higher K i first (we undo ties at random) and re-evaluate all K i s after each removal. To measure the percolation state of the multiplex, we compute its mutually connected component (MCC) as the largest fraction of nodes that are connected by a path in every layer using only nodes in the component [4]. Figure 1 shows results for the real arXiv collaboration, C. Elegans, Drosophila, and Sacc Pomb multiplex (see Table I, SM Section I, and Supplementary Videos I-IV) as well as for their reshuffled counterparts (an illustration of a targeted attack sequence is shown in Fig. 2ad). To create the reshuffled counterpart, we randomly reshuffled the translayer node-to-node mappings by selecting one of the layers and randomly interchanging the internal IDs of the nodes in that layer. This process destroys all correlations between the layers without altering the layers' topologies [15]. We quantify the vulnerability of the real and reshuffled multiplexes by calculating the critical number of nodes, ∆N . The removal of this critical number reduces the size of the MCC from more than aM to less than M β , where M is the initial size of the MCC before any nodes are removed, A ≤ 1 is a threshold parameter, and β < 1 [16]. We set a = 0.4, β = 0.5. The larger the ∆N , the more robust (less vulnerable) the system is. For the real arXiv multiplex we find that ∆N ≈ 25, while for its reshuffled counterpart ∆N rs = 1. In fact, in the reshuffled system, the removal of a single node reduces the relative size of the MCC from 73% to only 0.25%. This is far more pronounced than the limits of A = 40% and √ M /M = 3.6%, and is enough to virtually disconnect this system. We have considered other layer pairs of the arXiv, as well as a large number of other real multiplexes from different domains (technological, social, and biological). We found that in the vast majority of cases, the real system is significantly more robust against targeted attacks than its reshuffled counterpart (see Table I and SM Sections I, II).
Below, we show that this increased robustness of real multiplexes to targeted attacks is due to hidden geometric correlations interwoven in their layers [15], which do not exist in their reshuffled counterparts. These correlations are called "hidden" because they are not directly observable by looking at the topology of each individual network. Specifically, each single network layer can be mapped (or embedded) into a separate hyperbolic space, where each node i is represented by its polar coordinates, (r i , θ i ) [17][18][19]. The radial coordinate r i abstracts node popularity. The angular distance between two nodes, ∆θ ij = π − |π − |θ i − θ j ||, abstracts their similarity [20]. The hyperbolic distance, x ij = cosh −1 (cosh r i cosh r j − sinh r i sinh r j cos ∆θ ij ), is then a metric combination of the two attractiveness attributes, popularity (radial) and similarity (angular), such that the smaller the hyperbolic distance between two nodes, the higher the probability that they are connected in  Table I. Analyzed datasets for selected layer pairs (see SM Section I for all layer pairs). MCC denotes the initial size of the MCC, ∆N denotes the critical number of nodes whose removal reduces the MCC from 40% to √ M /M (in relative size), and ∆Nrs the same for the reshuffled system. Values are averages over 100 realizations of the removal process. NMI denotes the normalized mutual information as calculated in [15], and gives a measure of the strength of angular correlations between the layers of the considered real systems. the observable network [21]. The node coordinates of a given real network can be inferred using Maximum Likelihood Estimation techniques [17][18][19]. Recently, it has been shown that both the radial and angular coordinates of nodes in different layers of real multiplexes are significantly correlated [15].
Radial correlations are equivalent to interlayer degree correlations [22]. Angular correlations, instead, lead to sets of nodes that are similar-close in the angular similarity space-in each layer of the multiplex [15]. The reshuffling process explained earlier destroys both radial and angular correlations between the layers. The extreme vulnerability of the reshuffled counterparts in comparison to the real systems raises fundamental questions: Are the radial (i.e., interlayer degree) correlations, or angular (i.e., geometric) correlations, or both, responsible for the robustness of real systems, and which of these correlations can help to avoid catastrophic cascading failure when multiplexes are under targeted attack?
To investigate these questions, we use the geometric multiplex model (GMM) [15] to generate synthetic twolayer multiplexes, which resemble the real equivalents. The model produces multiplexes with layers embedded into hyperbolic planes, whereby the strength of interlayer correlations between the radial and angular coordinates of nodes that simultaneously exist in both layers can be tuned by varying the model parameters ν ∈ [0, 1] and g ∈ [0, 1]. Radial correlations increase with parameter ν (ν = 0 for no radial correlations, whereas ν = 1 for maximal radial correlations). Similarly, angular correlations increase with parameter g (g = 0 for no angular correlations, while g = 1 for maximal angular correlations).
We find that synthetic multiplexes without angular correlations exhibit an extreme vulnerability to targeted attacks (see Fig. 2e, SM Section III, and Supplementary Video V), similarly to the reshuffled counterparts of real systems (cf. Fig. 1 and SM Section II). In particular, if the multiplex is sufficiently large, then the removal of only a single node can reduce the size of the MCC from 40% to the square root of its initial size, thus destroying the connectivity of the system, see Fig. 2g. The abrupt character of the transition is also reflected in the distribution of mutually connected component sizes. In the fragmented phase, the entire network is always split into very small components, even when the system is very close to the transition. In the percolated phase, only nodes that do not belong to the MCC remain fragmented into small components (see SM Section IV). This behavior is not affected by the strength of the radial (i.e., interlayer degree) correlations in the system. Thus, in contrast to the mitigation effect for random failures, interlayer degree correlations do not avoid an abrupt transition in the case of targeted attacks, and essentially do not affect the robustness of the system.
On the other hand, this extreme vulnerability is mitigated if angular correlations are present. In Fig. 2a-d and e, we show the MCC percolation transition for maximal angular correlations (see also SM Sections II, III, and Supplementary Video V). We observe that the transition does indeed start with a multistep cascading process for relatively small system sizes. However, as shown in Fig. 2f, the relative size of the largest jump after a single node removal decreases with the system size, in stark contrast to the case without angular correlations, where this quantity becomes size independent. This suggests that, in the thermodynamic limit, the system undergoes a continuous transition (see inset in Fig. 2e). In particular, the critical number of nodes, ∆N , scales with the system size, see Fig. 2h and SM Section V, in stark contrast to the previous case. Furthermore, the size of the second largest component scales with the system size like N σ , with σ ≈ 0.84 (see SM Section VI). Finally, at the transition, the distribution of component sizes fol-   lows a power-law (see SM Section IV). Thus, we conjecture that angular correlations can lead to a multistep cascading process for relatively small system sizes, and can give rise to a continuous transition in the thermodynamic limit (happening in a range of parameters of the model-including those used in Fig. 2e-h-such that the multiplex layers have strong metric structure but do not loose the small-world property in the targeted attack process, see SM Section VII). This behavior is not affected by the strength of radial (i.e., interlayer degree) correlations and cannot be explained by the link overlap induced by geometric correlations (see SM Section VIII). Taken together, our results suggest that angular (similarity) correlations can mitigate the extreme vulnerability of real multiplexes against targeted attacks.
We can validate this conclusion in real systems. To this end, we compare the vulnerability of each of the considered real multiplexes (see Table I and SM Section I) with that of its reshuffled counterpart. We define the relative mitigation of vulnerability as where ∆N and ∆N rs are the number of nodes needed for the critical reduction of the size of the MCC of the real and reshuffled systems, see Table I and SM Section I. Ω is a measure of how much more resilient the real networks are compared to their reshuffled counterparts. Next, we study how Ω behaves as a function of the strength of angular correlations in the considered real systems. We quantify the strength of interlayer angular correlations by calculating the normalized mutual information, N M I, between the inferred angular coordinates of nodes in different layers [15] (see SM Section IX). A larger N M I means higher angular correlations. We find a strong positive correlation (ρ ≈ 0.6) between the strength of angular correlations in the real systems and their relative mitigation of vulnerability, see Fig. 3. This finding val-idates our previous arguments with real data, and highlights the importance of angular correlations in making real multiplexes robust against targeted attacks. The gain of robustness due to angular correlations can be understood intuitively by the formation of macroscopic mutually connected structures on the periphery of the hyperbolic disc in each layer. After enough nodes are removed, the remaining multiplex resembles a "double ring" (Fig. 2c), because the higher degree nodes which have been removed had lower radial coordinates and hence were closer. If angular correlations are present, the remaining lower degree nodes that are close in one layer tend to also be close in the other layer. As a consequence, the double ring contains macroscopic mutually connected structures (Fig. 2d) that sustain connectivity in the system. Notice that the mitigation of the extreme vulnerability of multiplexes by the effect of angular correlations is directly related to their geometric nature and cannot be explained by any topological feature. To support this point, we checked whether interlayer clustering correlations (being clustering the topological feature which is more directly related to the metric properties of networks [20]) or edge overlap induced by geometric correlations are sufficient to produce the mitigation effect. The results, see SM Sections VIII and X, indicate that in the absence of angular correlations, neither clustering correlations nor overlap can explain the observed mitigation effect. We take this to be a new validation of the geometric nature of complex networks and of the role of geometric correlations in multiplexes.
To conclude, we have shown that the strength of geometric (similarity) correlations in real multiplex networks is a good predictor for their robustness against targeted attacks, providing, for the first time, strong empirical evidence for the relevance of this mechanism in real systems. Using a geometric multiplex network model, we have shown that multiplex networks are extremely vulnerable against targeted attacks, exhibiting a discontinuous phase transition if geometric (similarity) correlations are absent. Contrarily, the presence of such correlations mitigates this vulnerability significantly, inducing a multistep cascading process in relatively small systems which does not destroy the system completely but lead into an eventually smooth percolation transition, with results suggesting that it can be fully continuous in the thermodynamic limit. In particular, the critical number of nodes that has to be removed to disconnect the system scales with the system size only if geometric correlations are present. Our results can help when designing efficient protection strategies and more robust and controllable interdependent systems. In addition, the results highlight that dependent networks without similarity correlations are extremely vulnerable to targeted attacks. Finally, our findings pave the way for an exact analysis of the percolation properties of such systems via their hidden geometric spaces.