Efficient algorithm to compute mutually connected components in interdependent networks

Link overlap influences opinion dynamics on multiplex networks of Ashkin-Teller spins

Consider a multiplex network formed by two layers indicating social interactions: the first layer is a friendship network and the second layer is a network of business relations. In this duplex network each pair of individuals can be connected in different ways: they can be connected by a friendship but not connected by a business relation, they can be connected by a business relation without being friends, or they can be simultaneously friends and in a business relation. In the latter case we say that the links in different layers overlap. These three types of connections are called multilinks and the multidegree indicates the sum of multilinks of a given type that are incident to a given node. Previous opinion models on multilayer networks have mostly neglected the effect of link overlap. Here we show that link overlap can have important effects in the formation of a majority opinion. Indeed, the formation of a majority opinion can be significantly influenced by the statistical properties of multilinks, and in particular by the multidegree distribution. To quantitatively address this problem, we study a simple spin model, called the Ashkin-Teller model, including two-body and four-body interactions between nodes in different layers. Here we fully investigate the rich phase diagram of this model which includes a large variety of phase transitions. Indeed, the phase diagram or the model displays continuous, discontinuous, and hybrid phase transitions, and successive jumps of the order parameters within the Baxter phase.

Hybrid phase transition into an absorbing state: Percolation and avalanches

Interdependent networks are more fragile under random attacks than simplex networks, because interlayer dependencies lead to cascading failures and finally to a sudden collapse. This is a hybrid phase transition (HPT), meaning that at the transition point the order parameter has a jump but there are also critical phenomena related to it. Here we study these phenomena on the Erdős-Rényi and the two-dimensional interdependent networks and show that the hybrid percolation transition exhibits two kinds of critical behaviors: divergence of the fluctuations of the order parameter and power-law size distribution of finite avalanches at a transition point. At the transition point global or "infinite" avalanches occur, while the finite ones have a power law size distribution; thus the avalanche statistics also has the nature of a HPT. The exponent β_{m} of the order parameter is 1/2 under general conditions, while the value of the exponent γ_{m} characterizing the fluctuations of the order parameter depends on the system. The critical behavior of the finite avalanches can be described by another set of exponents, β_{a} and γ_{a}. These two critical behaviors are coupled by a scaling law: 1-β_{m}=γ_{a}.

Multiplex networks with heterogeneous activities of the nodes

In multiplex networks with a large number of layers, the nodes can have different activities, indicating the total number of layers in which the nodes are present. Here we model multiplex networks with heterogeneous activity of the nodes and we study their robustness properties. We introduce a percolation model where nodes need to belong to the giant component only on the layers where they are active (i.e., their degree on that layer is larger than zero). We show that when there are enough nodes active only in one layer, the multiplex becomes more resilient and the transition becomes continuous. We find that multiplex networks with a power-law distribution of node activities are more fragile if the distribution of activity is broader. We also show that while positive correlations between node activity and degree can enhance the robustness of the system, the phase transition may become discontinuous, making the system highly unpredictable.

Percolation transitions in the survival of interdependent agents on multiplex networks, catastrophic cascades, and solid-on-solid surface growth

We present an efficient algorithm for simulating percolation transitions of mutually supporting viable clusters on multiplex networks (also known as "catastrophic cascades on interdependent networks"). This algorithm maps the problem onto a solid-on-solid-type model. We use this algorithm to study interdependent agents on duplex Erdös-Rényi (ER) networks and on lattices with dimensions 2, 3, 4, and 5. We obtain surprising results in all these cases, and we correct statements in the literature for ER networks and for two-dimensional lattices. In particular, we find that d=4 is the upper critical dimension and that the percolation transition is continuous for d≤4 but-at least for d≠3-not in the universality class of ordinary percolation. For ER networks we verify that the cluster statistics is exactly described by mean-field theory but find evidence that the cascade process is not. For d=5 we find a first-order transition as for ER networks, but we find also that small clusters have a nontrivial mass distribution that scales at the transition point. Finally, for d=2 with intermediate-range dependency links we propose a scenario that differs from that proposed in W. Li et al. [Phys. Rev. Lett. 108, 228702 (2012)].