Percolation in multiplex networks with overlap

Quasispecies theory and emerging viruses: challenges and applications

Quasispecies theory revolutionized our understanding of viral evolution by describing viruses as dynamic populations of genetically diverse variants constantly adapting. This article explores the theory's role in virus-host interactions, including immune evasion, drug resistance, and viral emergence. We review the original model, recent advances, and key virus dynamics needing incorporation into quasispecies theory. We introduce the ultracube concept as a more realistic multidimensional sequence space to investigate virus evolutionary dynamics.

Hidden multiscale organization and robustness of real multiplex networks

Hidden geometry enables the investigation of complex networks at different scales. Extending this framework to multiplex networks, we uncover a different kind of mesoscopic organization in real multiplex systems, named clan, a group of nodes that preserve local geometric arrangements across layers. Furthermore, we reveal the intimate relationship between the unfolding of clan structure and mutual percolation against targeted attacks, leading to an ambivalent role of clans: making a system fragile yet less prone to complete shattering. Finally, we confirm the correlation between the multiscale nature of geometric organization and the overall robustness. Our findings expand the significance of hidden geometry in network function, while also highlighting potential pitfalls in evaluating and controlling catastrophic failure of multiplex systems.

Percolation Theories for Quantum Networks

Quantum networks have experienced rapid advancements in both theoretical and experimental domains over the last decade, making it increasingly important to understand their large-scale features from the viewpoint of statistical physics. This review paper discusses a fundamental question: how can entanglement be effectively and indirectly (e.g., through intermediate nodes) distributed between distant nodes in an imperfect quantum network, where the connections are only partially entangled and subject to quantum noise? We survey recent studies addressing this issue by drawing exact or approximate mappings to percolation theory, a branch of statistical physics centered on network connectivity. Notably, we show that the classical percolation frameworks do not uniquely define the network's indirect connectivity. This realization leads to the emergence of an alternative theory called "concurrence percolation", which uncovers a previously unrecognized quantum advantage that emerges at large scales, suggesting that quantum networks are more resilient than initially assumed within classical percolation contexts, offering refreshing insights into future quantum network design.

Prediction and mitigation of nonlocal cascading failures using graph neural networks

Cascading failures in electrical power grids, comprising nodes and links, propagate nonlocally. After a local disturbance, successive resultant can be distant from the source. Since avalanche failures can propagate unexpectedly, care must be taken when formulating a mitigation strategy. Herein, we propose a strategy for mitigating such cascading failures. First, to characterize the impact of each node on the avalanche dynamics, we propose a novel measure, that of Avalanche Centrality (AC). Then, based on the ACs, nodes potentially needing reinforcement are identified and selected for mitigation. Compared with heuristic measures, AC has proven to be efficient at reducing avalanche size; however, due to nonlocal propagation, calculating ACs can be computationally burdensome. To resolve this problem, we use a graph neural network (GNN). We begin by training a GNN using a large number of small networks; then, once trained, the GNN can predict ACs efficiently in large networks and real-world topological power grids in manageable computational time. Thus, under our strategy, mitigation in large networks is achieved by reinforcing nodes with large ACs. The framework developed in this study can be implemented in other complex processes that require longer computational time to simulate large networks.

Plant Virus Adaptation to New Hosts: A Multi-scale Approach

Viruses are studied at each level of biological complexity: from within-cells to ecosystems. The same basic evolutionary forces and principles operate at each level: mutation and recombination, selection, genetic drift, migration, and adaptive trade-offs. Great efforts have been put into understanding each level in great detail, hoping to predict the dynamics of viral population, prevent virus emergence, and manage their spread and virulence. Unfortunately, we are still far from this. To achieve these ambitious goals, we advocate for an integrative perspective of virus evolution. Focusing in plant viruses, we illustrate the pervasiveness of the above-mentioned principles. Beginning at the within-cell level, we describe replication modes, infection bottlenecks, and cellular contagion rates. Next, we move up to the colonization of distal tissues, discussing the fundamental role of random events. Then, we jump beyond the individual host and discuss the link between transmission mode and virulence. Finally, at the community level, we discuss properties of virus-plant infection networks. To close this review we propose the multilayer network theory, in which elements at different layers are connected and submit to their own dynamics that feed across layers, resulting in new emerging properties, as a way to integrate information from the different levels.

A tensor-based formulation of hetero-functional graph theory

Recently, hetero-functional graph theory (HFGT) has developed as a means to mathematically model the structure of large-scale complex flexible engineering systems. It does so by fusing concepts from network science and model-based systems engineering (MBSE). For the former, it utilizes multiple graph-based data structures to support a matrix-based quantitative analysis. For the latter, HFGT inherits the heterogeneity of conceptual and ontological constructs found in model-based systems engineering including system form, system function, and system concept. These diverse conceptual constructs indicate multi-dimensional rather than two-dimensional relationships. This paper provides the first tensor-based treatment of hetero-functional graph theory. In particular, it addresses the "system concept" and the hetero-functional adjacency matrix from the perspective of tensors and introduces the hetero-functional incidence tensor as a new data structure. The tensor-based formulation described in this work makes a stronger tie between HFGT and its ontological foundations in MBSE. Finally, the tensor-based formulation facilitates several analytical results that provide an understanding of the relationships between HFGT and multi-layer networks.

Correlation analysis of combined layers in multiplex networks based on entropy

The interactions between layers of a multiplex network would generate new structural features, the most prominent feature being the existence of link overlaps between layers. How to capture the associations with the network behavior through the structural interaction between the combined layers of the multiplex network is a critical issue. In this paper, a new structure entropy is proposed by combining the overlapping links between the combined layers of a multiplex network. The correlation between layers is evaluated by structure entropy, and the results are consistent with the behaviors exhibited by the network. In addition, the validity and applicability of the proposed method were verified by conducting trials on four sets of real multiplex network data, which included the multiplex social network of a research department at Aarhus, tailor shop multiplex network, C. elegans multiplex network, and the network collected by Vickers from 29 seventh grade students in a school in Victoria.

The fundamental benefits of multiplexity in ecological networks

A tipping point presents perhaps the single most significant threat to an ecological system as it can lead to abrupt species extinction on a massive scale. Climate changes leading to the species decay parameter drifts can drive various ecological systems towards a tipping point. We investigate the tipping-point dynamics in multi-layer ecological networks supported by mutualism. We unveil a natural mechanism by which the occurrence of tipping points can be delayed by multiplexity that broadly describes the diversity of the species abundances, the complexity of the interspecific relationships, and the topology of linkages in ecological networks. For a double-layer system of pollinators and plants, coupling between the network layers occurs when there is dispersal of pollinator species. Multiplexity emerges as the dispersing species establish their presence in the destination layer and have a simultaneous presence in both. We demonstrate that the new mutualistic links induced by the dispersing species with the residence species have fundamental benefits to the well-being of the ecosystem in delaying the tipping point and facilitating species recovery. Articulating and implementing control mechanisms to induce multiplexity can thus help sustain certain types of ecosystems that are in danger of extinction as the result of environmental changes.

Targeting attack hypergraph networks

In modern systems, from brain neural networks to social group networks, pairwise interactions are not sufficient to express higher-order relationships. The smallest unit of their internal function is not composed of a single functional node but results from multiple functional nodes acting together. Therefore, researchers adopt the hypergraph to describe complex systems. The targeted attack on random hypergraph networks is still a problem worthy of study. This work puts forward a theoretical framework to analyze the robustness of random hypergraph networks under the background of a targeted attack on nodes with high or low hyperdegrees. We discovered the process of cascading failures and the giant connected cluster (GCC) of the hypergraph network under targeted attack by associating the simple mapping of the factor graph with the hypergraph and using percolation theory and generating function. On random hypergraph networks, we do Monte-Carlo simulations and find that the theoretical findings match the simulation results. Similarly, targeted attacks are more effective than random failures in disintegrating random hypergraph networks. The threshold of the hypergraph network grows as the probability of high hyperdegree nodes being deleted increases, indicating that the network's resilience becomes more fragile. When considering real-world scenarios, our conclusions are validated by real-world hypergraph networks. These findings will help us understand the impact of the hypergraph's underlying structure on network resilience.

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.

Higher-order percolation processes on multiplex hypergraphs

Higher-order interactions are increasingly recognized as a fundamental aspect of complex systems ranging from the brain to social contact networks. Hypergraphs as well as simplicial complexes capture the higher-order interactions of complex systems and allow us to investigate the relation between their higher-order structure and their function. Here we establish a general framework for assessing hypergraph robustness and we characterize the critical properties of simple and higher-order percolation processes. This general framework builds on the formulation of the random multiplex hypergraph ensemble where each layer is characterized by hyperedges of given cardinality. We observe that in presence of the structural cutoff the ensemble of multiplex hypergraphs can be mapped to an ensemble of multiplex bipartite networks. We reveal the relation between higher-order percolation processes in random multiplex hypergraphs, interdependent percolation of multiplex networks, and K-core percolation. The structural correlations of the random multiplex hypergraphs are shown to have a significant effect on their percolation properties. The wide range of critical behaviors observed for higher-order percolation processes on multiplex hypergraphs elucidates the mechanisms responsible for the emergence of discontinuous transition and uncovers interesting critical properties which can be applied to the study of epidemic spreading and contagion processes on higher-order networks.

Internetwork connectivity of molecular networks across species of life

Molecular interactions are studied as independent networks in systems biology. However, molecular networks do not exist independently of each other. In a network of networks approach (called multiplex), we study the joint organization of transcriptional regulatory network (TRN) and protein-protein interaction (PPI) network. We find that TRN and PPI are non-randomly coupled across five different eukaryotic species. Gene degrees in TRN (number of downstream genes) are positively correlated with protein degrees in PPI (number of interacting protein partners). Gene-gene and protein-protein interactions in TRN and PPI, respectively, also non-randomly overlap. These design principles are conserved across the five eukaryotic species. Robustness of the TRN-PPI multiplex is dependent on this coupling. Functionally important genes and proteins, such as essential, disease-related and those interacting with pathogen proteins, are preferentially situated in important parts of the human multiplex with highly overlapping interactions. We unveil the multiplex architecture of TRN and PPI. Multiplex architecture may thus define a general framework for studying molecular networks. This approach may uncover the building blocks of the hierarchical organization of molecular interactions.

Dependency-based targeted attacks in interdependent networks

Modern large engineered network systems normally work in cooperation and incorporate dependencies between their components for purposes of efficiency and regulation. Such dependencies may become a major risk since they can cause small-scale failures to propagate throughout the system. Thus, the dependent nodes could be a natural target for malicious attacks that aim to exploit these vulnerabilities. Here we consider a type of targeted attack that is based on the dependencies between the networks. We study strategies of attacks that range from dependency-first to dependency-last, where a fraction 1-p of the nodes with dependency links, or nodes without dependency links, respectively, are initially attacked. We systematically analyze, both analytically and numerically, the percolation transition of partially interdependent networks, where a fraction q of the nodes in each network are dependent on nodes in the other network. We find that for a broad range of dependency strength q, the "dependency-first" attack strategy is actually less effective, in terms of lower critical percolation threshold p_{c}, compared with random attacks of the same size. In contrast, the "dependency-last" attack strategy is more effective, i.e., higher p_{c}, compared with a random attack. This effect is explained by exploring the dynamics of the cascading failures initiated by dependency-based attacks. We show that while "dependency-first" strategy increases the short-term impact of the initial attack, in the long term the cascade slows down compared with the case of random attacks and vice versa for "dependency-last." Our results demonstrate that the effectiveness of attack strategies over a system of interdependent networks should be evaluated not only by the immediate impact but mainly by the accumulated damage during the process of cascading failures. This highlights the importance of understanding the dynamics of avalanches that may occur due to different scenarios of failures in order to design resilient critical infrastructures.

Asymmetric interdependent networks with multiple-dependence relation

In this paper, we study the robustness of interdependent networks with multiple-dependence (MD) relation which is defined that a node is interdependent on several nodes on another layer, and this node will fail if any of these dependent nodes are failed. We propose a two-layered asymmetric interdependent network (AIN) model to address this problem, where the asymmetric feature is that nodes in one layer may be dependent on more than one node in the other layer with MD relation, while nodes in the other layer are dependent on exactly one node in this layer. We show that in this model the layer where nodes are allowed to have MD relation exhibits different types of phase transitions (discontinuous and hybrid), while the other layer only presents discontinuous phase transition. A heuristic theory based on message-passing approach is developed to understand the structural feature of interdependent networks and an intuitive picture for the emergence of a tricritical point is provided. Moreover, we study the correlation between the intralayer degree and interlayer degree of the nodes and find that this correlation has prominent impact to the continuous phase transition but has feeble effect on the discontinuous phase transition. Furthermore, we extend the two-layered AIN model to general multilayered AIN, and the percolation behaviors and properties of relevant phase transitions are elaborated.

Multi-Agent Systems and Complex Networks: Review and Applications in Systems Engineering

Systems engineering is an ubiquitous discipline of Engineering overlapping industrial, chemical, mechanical, manufacturing, control, software, electrical, and civil engineering. It provides tools for dealing with the complexity and dynamics related to the optimisation of physical, natural, and virtual systems management. This paper presents a review of how multi-agent systems and complex networks theory are brought together to address systems engineering and management problems. The review also encompasses current and future research directions both for theoretical fundamentals and applications in the industry. This is made by considering trends such as mesoscale, multiscale, and multilayer networks along with the state-of-art analysis on network dynamics and intelligent networks. Critical and smart infrastructure, manufacturing processes, and supply chain networks are instances of research topics for which this literature review is highly relevant.

Asymmetry in interdependence makes a multilayer system more robust against cascading failures

Multilayer networked systems are ubiquitous in nature and engineering, and the robustness of these systems against failures is of great interest. A main line of theoretical pursuit has been percolation-induced cascading failures, where interdependence between network layers is conveniently and tacitly assumed to be symmetric. In the real world, interdependent interactions are generally asymmetric. To uncover and quantify the impact of asymmetry in interdependence on network robustness, we focus on percolation dynamics in double-layer systems and implement the following failure mechanism: Once a node in a network layer fails, the damage it can cause depends not only on its position in the layer but also on the position of its counterpart neighbor in the other layer. We find that the characteristics of the percolation transition depend on the degree of asymmetry, where the striking phenomenon of a switch in the nature of the phase transition from first to second order arises. We derive a theory to calculate the percolation transition points in both network layers, as well as the transition switching point, with strong numerical support from synthetic and empirical networks. Not only does our work shed light on the factors that determine the robustness of multilayer networks against cascading failures, but it also provides a scenario by which the system can be designed or controlled to reach a desirable level of resilience.

Using Sparse Representation to Detect Anomalies in Complex WSNs

In recent years, wireless sensor networks (WSNs) have become an active area of research for monitoring physical and environmental conditions. Due to the interdependence of sensors, a functional anomaly in one sensor can cause a functional anomaly in another sensor, which can further lead to the malfunctioning of the entire sensor network. Existing research work has analysed faulty sensor anomalies but fails to show the effectiveness throughout the entire interdependent network system. In this article, a dictionary learning algorithm based on a non-negative constraint is developed, and a sparse representation anomaly node detection method for sensor networks is proposed based on the dictionary learning. Through experiment on a specific thermal power plant in China, we verify the robustness of our proposed method in detecting abnormal nodes against four state of the art approaches and proved our method is more robust. Furthermore, the experiments are conducted on the obtained abnormal nodes to prove the interdependence of multi-layer sensor networks and reveal the conditions and causes of a system crash.

Reentrant phase transitions in threshold driven contagion on multiplex networks

Models of threshold driven contagion explain the cascading spread of information, behavior, systemic risk, and epidemics on social, financial, and biological networks. At odds with empirical observations, these models predict that single-layer unweighted networks become resistant to global cascades after reaching sufficient connectivity. We investigate threshold driven contagion on weight heterogeneous multiplex networks and show that they can remain susceptible to global cascades at any level of connectivity, and with increasing edge density pass through alternating phases of stability and instability in the form of reentrant phase transitions of contagion. Our results provide a theoretical explanation for the observation of large-scale contagion in highly connected but heterogeneous networks.

Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions

Determining design principles that boost the robustness of interdependent networks is a fundamental question of engineering, economics, and biology. It is known that maximizing the degree correlation between replicas of the same node leads to optimal robustness. Here we show that increased robustness might also come at the expense of introducing multiple phase transitions. These results reveal yet another possible source of fragility of multiplex networks that has to be taken into the account during network optimization and design.

Analysing livestock network data for infectious disease control: an argument for routine data collection in emerging economies

Livestock movements are an important mechanism of infectious disease transmission. Where these are well recorded, network analysis tools have been used to successfully identify system properties, highlight vulnerabilities to transmission, and inform targeted surveillance and control. Here we highlight the main uses of network properties in understanding livestock disease epidemiology and discuss statistical approaches to infer network characteristics from biased or fragmented datasets. We use a 'hurdle model' approach that predicts (i) the probability of movement and (ii) the number of livestock moved to generate synthetic 'complete' networks of movements between administrative wards, exploiting routinely collected government movement permit data from northern Tanzania. We demonstrate that this model captures a significant amount of the observed variation. Combining the cattle movement network with a spatial between-ward contact layer, we create a multiplex, over which we simulated the spread of 'fast' ( R0 = 3) and 'slow' ( R0 = 1.5) pathogens, and assess the effects of random versus targeted disease control interventions (vaccination and movement ban). The targeted interventions substantially outperform those randomly implemented for both fast and slow pathogens. Our findings provide motivation to encourage routine collection and centralization of movement data to construct representative networks. This article is part of the theme issue 'Modelling infectious disease outbreaks in humans, animals and plants: epidemic forecasting and control'. This theme issue is linked with the earlier issue 'Modelling infectious disease outbreaks in humans, animals and plants: approaches and important themes'.

Discordant attributes of structural and functional brain connectivity in a two-layer multiplex network

Several studies have suggested that functional connectivity (FC) is constrained by the underlying structural connectivity (SC) and mutually correlated. However, not many studies have focused on differences in the network organization of SC and FC, and on how these differences may inform us about their mutual interaction. To explore this issue, we adopt a multi-layer framework, with SC and FC, constructed using Magnetic Resonance Imaging (MRI) data from the Human Connectome Project, forming a two-layer multiplex network. In particular, we examine node strength assortativity within and between the SC and FC layer. We find that, in general, SC is organized assortatively, indicating brain regions are on average connected to other brain regions with similar node strengths. On the other hand, FC shows disassortative mixing. This discrepancy is apparent also among individual resting-state networks within SC and FC. In addition, these patterns show lateralization, with disassortative mixing within FC subnetworks mainly driven from the left hemisphere. We discuss our findings in the context of robustness to structural failure, and we suggest that discordant and lateralized patterns of associativity in SC and FC may provide clues to understand laterality of some neurological dysfunctions and recovery.

Multiple phase transitions in networks of directed networks

The robustness in real-world complex systems with dependency connectivities differs from that in isolated networks. Although most complex network research has focused on interdependent undirected systems, many real-world networks-such as gene regulatory networks and traffic networks-are directed. We thus develop an analytical framework for examining the robustness of networks made up of directed networks of differing topologies. We use it to predict the phase transitions that occur during node failures and to generate the phase diagrams of a number of different systems, including treelike and random regular (RR) networks of directed Erdős-Rényi (ER) networks and scale-free networks. We find that the the phase transition and phase diagram of networks of directed networks differ from those of networks of undirected networks. For example, the RR networks of directed ER networks show a hybrid phase transition that does not occur in networks of undirected ER networks. In addition, system robustness is affected by network topology in networks of directed networks. As coupling strength q increases, treelike networks of directed ER networks change from a second-order phase transition to a first-order phase transition, and RR networks of directed ER networks change from a second-order phase transition to a hybrid phase transition, then to a first-order phase transition, and finally to a region of collapse. We also find that heterogenous network systems are more robust than homogeneous network systems. We note that there are multiple phase transitions and triple points in the phase diagram of RR networks of directed networks and this helps us understand how to increase network robustness when designing interdependent infrastructure systems.

Link persistence and conditional distances in multiplex networks

Recent progress towards unraveling the hidden geometric organization of real multiplexes revealed significant correlations across the hyperbolic node coordinates in different network layers, which facilitated applications like translayer link prediction and mutual navigation. But, are geometric correlations alone sufficient to explain the topological relation between the layers of real systems? Here, we provide the negative answer to this question. We show that connections in real systems tend to persist from one layer to another irrespective of their hyperbolic distances. This suggests that in addition to purely geometric aspects, the explicit link formation process in one layer impacts the topology of other layers. Based on this finding, we present a simple modification to the recently developed geometric multiplex model to account for this effect, and show that the extended model can reproduce the behavior observed in real systems. We also find that link persistence is significant in all considered multiplexes and can explain their layers' high edge overlap, which cannot be explained by coordinate correlations alone. Furthermore, by taking both link persistence and hyperbolic distance correlations into account, we can improve translayer link prediction. These findings guide the development of multiplex embedding methods, suggesting that such methods should account for both coordinate correlations and link persistence across layers.

Bond percolation in coloured and multiplex networks

Percolation in complex networks is a process that mimics network degradation and a tool that reveals peculiarities of the network structure. During the course of percolation, the emergent properties of networks undergo non-trivial transformations, which include a phase transition in the connectivity, and in some special cases, multiple phase transitions. Such global transformations are caused by only subtle changes in the degree distribution, which locally describe the network. Here we establish a generic analytic theory that describes how structure and sizes of all connected components in the network are affected by simple and colour-dependent bond percolations. This theory predicts locations of the phase transitions, existence of wide critical regimes that do not vanish in the thermodynamic limit, and a phenomenon of colour switching in small components. These results may be used to design percolation-like processes, optimise network response to percolation, and detect subtle signals preceding network collapse.

Percolation is a tool used to investigate a network’s response as random links are removed. Here the author presents a generic analytic theory to describe how percolation properties are affected in coloured networks, where the colour can represent a network feature such as multiplexity or the belonging to a community.

Assortative mixing in spatially-extended networks

We focus on spatially-extended networks during their transition from short-range connectivities to a scale-free structure expressed by heavy-tailed degree-distribution. In particular, a model is introduced for the generation of such graphs, which combines spatial growth and preferential attachment. In this model the transition to heterogeneous structures is always accompanied by a change in the graph's degree-degree correlation properties: while high assortativity levels characterize the dominance of short distance couplings, long-range connectivity structures are associated with small amounts of disassortativity. Our results allow to infer that a disassortative mixing is essential for establishing long-range links. We discuss also how our findings are consistent with recent experimental studies of 2-dimensional neuronal cultures.

Group percolation in interdependent networks

In many real network systems, nodes usually cooperate with each other and form groups to enhance their robustness to risks. This motivates us to study an alternative type of percolation, group percolation, in interdependent networks under attack. In this model, nodes belonging to the same group survive or fail together. We develop a theoretical framework for this group percolation and find that the formation of groups can improve the resilience of interdependent networks significantly. However, the percolation transition is always of first order, regardless of the distribution of group sizes. As an application, we map the interdependent networks with intersimilarity structures, which have attracted much attention recently, onto the group percolation and confirm the nonexistence of continuous phase transitions.

The "weak" interdependence of infrastructure systems produces mixed percolation transitions in multilayer networks

Previous studies of multilayer network robustness model cascading failures via a node-to-node percolation process that assumes "strong" interdependence across layers-once a node in any layer fails, its neighbors in other layers fail immediately and completely with all links removed. This assumption is not true of real interdependent infrastructures that have emergency procedures to buffer against cascades. In this work, we consider a node-to-link failure propagation mechanism and establish "weak" interdependence across layers via a tolerance parameter α which quantifies the likelihood that a node survives when one of its interdependent neighbors fails. Analytical and numerical results show that weak interdependence produces a striking phenomenon: layers at different positions within the multilayer system experience distinct percolation transitions. Especially, layers with high super degree values percolate in an abrupt manner, while those with low super degree values exhibit both continuous and discontinuous transitions. This novel phenomenon we call mixed percolation transitions has significant implications for network robustness. Previous results that do not consider cascade tolerance and layer super degree may be under- or over-estimating the vulnerability of real systems. Moreover, our model reveals how nodal protection activities influence failure dynamics in interdependent, multilayer systems.

Rare events and discontinuous percolation transitions

Percolation theory characterizing the robustness of a network has applications ranging from biology, to epidemic spreading, and complex infrastructures. Percolation theory, however, only concerns the average response of a network to random damage of its nodes while in real finite networks, fluctuations around this average behavior are observable. Consequently, for finite networks, there is an urgent need to evaluate the risk of collapse in response to rare configurations of the initial damage. Here, we build a large deviation theory of percolation characterizing the response of a sparse network to rare events. This general theory includes the second-order phase transition observed typically for random configurations of the initial damage, but reveals also discontinuous transitions corresponding to rare configurations of the initial damage for which the size of the giant component is suppressed.

Finite connected components in infinite directed and multiplex networks with arbitrary degree distributions

This work presents exact expressions for size distributions of weak and multilayer connected components in two generalizations of the configuration model: networks with directed edges and multiplex networks with an arbitrary number of layers. The expressions are computable in a polynomial time and, under some restrictions, are tractable from the asymptotic theory point of view. If first partial moments of the degree distribution are finite, the size distribution for two-layer connected components in multiplex networks exhibits an exponent -3/2 in the critical regime, whereas the size distribution of weakly connected components in directed networks exhibits two critical exponents -1/2 and -3/2.

Overload-based cascades on multiplex networks and effects of inter-similarity

Although cascading failures caused by overload on interdependent/interconnected networks have been studied in the recent years, the effect of overlapping links (inter-similarity) on robustness to such cascades in coupled networks is not well understood. This is an important issue since shared links exist in many real-world coupled networks. In this paper, we propose a new model for load-based cascading failures in multiplex networks. We leverage it to compare different network structures, coupling schemes, and overload rules. More importantly, we systematically investigate the impact of inter-similarity on the robustness of the whole system under an initial intentional attack. Surprisingly, we find that inter-similarity can have a negative impact on robustness to overload cascades. To the best of our knowledge, we are the first to report the competition between the positive and the negative impacts of overlapping links on the robustness of coupled networks. These results provide useful suggestions for designing robust coupled traffic systems.

Optimal percolation on multiplex networks

Optimal percolation is the problem of finding the minimal set of nodes whose removal from a network fragments the system into non-extensive disconnected clusters. The solution to this problem is important for strategies of immunization in disease spreading, and influence maximization in opinion dynamics. Optimal percolation has received considerable attention in the context of isolated networks. However, its generalization to multiplex networks has not yet been considered. Here we show that approximating the solution of the optimal percolation problem on a multiplex network with solutions valid for single-layer networks extracted from the multiplex may have serious consequences in the characterization of the true robustness of the system. We reach this conclusion by extending many of the methods for finding approximate solutions of the optimal percolation problem from single-layer to multiplex networks, and performing a systematic analysis on synthetic and real-world multiplex networks.

PageRank versatility analysis of multilayer modality-based network for exploring the evolution of oil-water slug flow

Numerous irregular flow structures exist in the complicated multiphase flow and result in lots of disparate spatial dynamical flow behaviors. The vertical oil-water slug flow continually attracts plenty of research interests on account of its significant importance. Based on the spatial transient flow information acquired through our designed double-layer distributed-sector conductance sensor, we construct multilayer modality-based network to encode the intricate spatial flow behavior. Particularly, we calculate the PageRank versatility and multilayer weighted clustering coefficient to quantitatively explore the inferred multilayer modality-based networks. Our analysis allows characterizing the complicated evolution of oil-water slug flow, from the opening formation of oil slugs, to the succedent inter-collision and coalescence among oil slugs, and then to the dispersed oil bubbles. These properties render our developed method particularly powerful for mining the essential flow features from the multilayer sensor measurements.

Fluctuations in percolation of sparse complex networks

We study the role of fluctuations in percolation of sparse complex networks. To this end we consider two random correlated realizations of the initial damage of the nodes and we evaluate the fraction of nodes that are expected to remain in the giant component of the network in both cases or just in one case. Our framework includes a message-passing algorithm able to predict the fluctuations in a single network, and an analytic prediction of the expected fluctuations in ensembles of sparse networks. This approach is applied to real ecological and infrastructure networks and it is shown to characterize the expected fluctuations in their response to external damage.

Optimizing diffusion in multiplexes by maximizing layer dissimilarity

Diffusion in a multiplex depends on the specific link distribution between the nodes in each layer, but also on the set of the intralayer and interlayer diffusion coefficients. In this work we investigate, in a quantitative way, the efficiency of multiplex diffusion as a function of the topological similarity among multiplex layers. This similarity is measured by the distance between layers, taken among the pairs of layers. Results are presented for a simple two-layer multiplex, where one of the layers is held fixed, while the other one can be rewired in a controlled way in order to increase or decrease the interlayer distance. The results indicate that, for fixed values of all intra- and interlayer diffusion coefficients, a large interlayer distance generally enhances the global multiplex diffusion, providing a topological mechanism to control the global diffusive process. For some sets of networks, we develop an algorithm to identify the most sensitive nodes in the rewirable layer, so that changes in a small set of connections produce a drastic enhancement of the global diffusion of the whole multiplex system.

Clustering determines the dynamics of complex contagions in multiplex networks

We present the mathematical analysis of generalized complex contagions in a class of clustered multiplex networks. The model is intended to understand spread of influence, or any other spreading process implying a threshold dynamics, in setups of interconnected networks with significant clustering. The contagion is assumed to be general enough to account for a content-dependent linear threshold model, where each link type has a different weight (for spreading influence) that may depend on the content (e.g., product, rumor, political view) that is being spread. Using the generating functions formalism, we determine the conditions, probability, and expected size of the emergent global cascades. This analysis provides a generalization of previous approaches and is especially useful in problems related to spreading and percolation. The results present nontrivial dependencies between the clustering coefficient of the networks and its average degree. In particular, several phase transitions are shown to occur depending on these descriptors. Generally speaking, our findings reveal that increasing clustering decreases the probability of having global cascades and their size, however, this tendency changes with the average degree. There exists a certain average degree from which on clustering favors the probability and size of the contagion. By comparing the dynamics of complex contagions over multiplex networks and their monoplex projections, we demonstrate that ignoring link types and aggregating network layers may lead to inaccurate conclusions about contagion dynamics, particularly when the correlation of degrees between layers is high.

Percolation in real multiplex networks

We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where nodes are present in the system with given probability. The approach relies on the locally treelike ansatz, so that it is expected to accurately reproduce the true percolation diagram of sparse multiplex networks with negligible number of short loops. The performance of our theory is tested in social, biological, and transportation multiplex graphs. When compared against previously introduced methods, we observe improvements in the prediction of the percolation diagrams in all networks analyzed. Results from our method confirm previous claims about the robustness of real multiplex networks, in the sense that the average connectedness of the system does not exhibit any significant abrupt change as its individual components are randomly destroyed.

Message passing theory for percolation models on multiplex networks with link overlap

Multiplex networks describe a large variety of complex systems, including infrastructures, transportation networks, and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to characterize the mutually connected giant component in these networks. Here we provide a message passing theory for characterizing the percolation transition in multiplex networks with link overlap and an arbitrary number of layers M. Specifically we propose and compare two message passing algorithms that generalize the algorithm widely used to study the percolation transition in multiplex networks without link overlap. The first algorithm describes a directed percolation transition and admits an epidemic spreading interpretation. The second algorithm describes the emergence of the mutually connected giant component, that is the percolation transition, but does not preserve the epidemic spreading interpretation. We obtain the phase diagrams for the percolation and directed percolation transition in simple representative cases. We demonstrate that for the same multiplex network structure, in which the directed percolation transition has nontrivial tricritical points, the percolation transition has a discontinuous phase transition, with the exception of the trivial case in which all the layers completely overlap.

Resilience of antagonistic networks with regard to the effects of initial failures and degree-degree correlations

In this study we investigate the resilience of duplex networked layers α and β coupled with antagonistic interlinks, each layer of which inhibits its counterpart at the microscopic level, changing the following factors: whether the influence of the initial failures in α remains [quenched (case Q)] or not [free (case F)]; the effect of intralayer degree-degree correlations in each layer and interlayer degree-degree correlations; and the type of the initial failures, such as random failures or targeted attacks (TAs). We illustrate that the percolation processes repeat in both cases Q and F, although only in case F are nodes that initially failed reactivated. To analytically evaluate the resilience of each layer, we develop a methodology based on the cavity method for deriving the size of a giant component (GC). Strong hysteresis, which is ignored in the standard cavity analysis, is observed in the repetition of the percolation processes particularly in case F. To handle this, we heuristically modify interlayer messages for macroscopic analysis, the utility of which is verified by numerical experiments. The percolation transition in each layer is continuous in both cases Q and F. We also analyze the influences of degree-degree correlations on the robustness of layer α, in particular for the case of TAs. The analysis indicates that the critical fraction of initial failures that makes the GC size in layer α vanish depends only on its intralayer degree-degree correlations. Although our model is defined in a somewhat abstract manner, it may have relevance to ecological systems that are composed of endangered species (layer α) and invaders (layer β), the former of which are damaged by the latter whereas the latter are exterminated in the areas where the former are active.

Mixed-order phase transition in a minimal, diffusion-based spin model

In this paper we exactly solve, within the grand canonical ensemble, a minimal spin model with the hybrid phase transition. We call the model diffusion based because its Hamiltonian can be recovered from a simple dynamic procedure, which can be seen as an equilibrium statistical mechanics representation of a biased random walk. We outline the derivation of the phase diagram of the model, in which the triple point has the hallmarks of the hybrid transition: discontinuity in the average magnetization and algebraically diverging susceptibilities. At this point, two second-order transition curves meet in equilibrium with the first-order curve, resulting in a prototypical mixed-order behavior.

Correlated edge overlaps in multiplex networks

We develop the theory of sparse multiplex networks with partially overlapping links based on their local treelikeness. This theory enables us to find the giant mutually connected component in a two-layer multiplex network with arbitrary correlations between connections of different types. We find that correlations between the overlapping and nonoverlapping links markedly change the phase diagram of the system, leading to multiple hybrid phase transitions. For assortative correlations we observe recurrent hybrid phase transitions.

Extracting information from multiplex networks

Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social, financial, engineering, and biological networks as well. Extending our ability to analyze complex networks to multiplex network structures increases greatly the level of information that is possible to extract from big data. For these reasons, characterizing the centrality of nodes in multiplex networks and finding new ways to solve challenging inference problems defined on multiplex networks are fundamental questions of network science. In this paper, we discuss the relevance of the Multiplex PageRank algorithm for measuring the centrality of nodes in multilayer networks and we characterize the utility of the recently introduced indicator function Θ̃(S) for describing their mesoscale organization and community structure. As working examples for studying these measures, we consider three multiplex network datasets coming for social science.

Spanning connectivity in a multilayer network and its relationship to site-bond percolation

We analyze the connectivity of an M-layer network over a common set of nodes that are active only in a fraction of the layers. Each layer is assumed to be a subgraph (of an underlying connectivity graph G) induced by each node being active in any given layer with probability q. The M-layer network is formed by aggregating the edges over all M layers. We show that when q exceeds a threshold q_{c}(M), a giant connected component appears in the M-layer network-thereby enabling far-away users to connect using "bridge" nodes that are active in multiple network layers-even though the individual layers may only have small disconnected islands of connectivity. We show that q_{c}(M)≲sqrt[-ln(1-p_{c})]/sqrt[M], where p_{c} is the bond percolation threshold of G, and q_{c}(1)≡q_{c} is its site-percolation threshold. We find q_{c}(M) exactly for when G is a large random network with an arbitrary node-degree distribution. We find q_{c}(M) numerically for various regular lattices and find an exact lower bound for the kagome lattice. Finally, we find an intriguingly close connection between this multilayer percolation model and the well-studied problem of site-bond percolation in the sense that both models provide a smooth transition between the traditional site- and bond-percolation models. Using this connection, we translate known analytical approximations of the site-bond critical region, which are functions only of p_{c} and q_{c} of the respective lattice, to excellent general approximations of the multilayer connectivity threshold q_{c}(M).

Strength of weak layers in cascading failures on multiplex networks: case of the international trade network

Many real-world complex systems across natural, social, and economical domains consist of manifold layers to form multiplex networks. The multiple network layers give rise to nonlinear effect for the emergent dynamics of systems. Especially, weak layers that can potentially play significant role in amplifying the vulnerability of multiplex networks might be shadowed in the aggregated single-layer network framework which indiscriminately accumulates all layers. Here we present a simple model of cascading failure on multiplex networks of weight-heterogeneous layers. By simulating the model on the multiplex network of international trades, we found that the multiplex model produces more catastrophic cascading failures which are the result of emergent collective effect of coupling layers, rather than the simple sum thereof. Therefore risks can be systematically underestimated in single-layer network analyses because the impact of weak layers can be overlooked. We anticipate that our simple theoretical study can contribute to further investigation and design of optimal risk-averse real-world complex systems.

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.

The effect of randomness for dependency map on the robustness of interdependent lattices

The percolation for interdependent networks with identical dependency map follows a second-order phase transition which is exactly the same with percolation on a single network, while percolation for random dependency follows a first-order phase transition. In real networks, the dependency relations between networks are neither identical nor completely random. Thus in this paper, we study the influence of randomness for dependency maps on the robustness of interdependent lattice networks. We introduce approximate entropy(ApEn) as the measure of randomness of the dependency maps. We find that there is critical ApEnc below which the percolation is continuous, but for larger ApEn, it is a first-order transition. With the increment of ApEn, the pc increases until ApEn reaching ApEnc (') and then remains almost constant. The time scale of the system shows rich properties as ApEn increases. Our results uncover that randomness is one of the important factors that lead to cascading failures of spatially interdependent networks.

Growing multiplex networks with arbitrary number of layers

This paper focuses on the problem of growing multiplex networks. Currently, the results on the joint degree distribution of growing multiplex networks present in the literature pertain to the case of two layers and are confined to the special case of homogeneous growth and are limited to the state state (that is, the limit of infinite size). In the present paper, we first obtain closed-form solutions for the joint degree distribution of heterogeneously growing multiplex networks with arbitrary number of layers in the steady state. Heterogeneous growth means that each incoming node establishes different numbers of links in different layers. We consider both uniform and preferential growth. We then extend the analysis of the uniform growth mechanism to arbitrary times. We obtain a closed-form solution for the time-dependent joint degree distribution of a growing multiplex network with arbitrary initial conditions. Throughout, theoretical findings are corroborated with Monte Carlo simulations. The results shed light on the effects of the initial network on the transient dynamics of growing multiplex networks and takes a step towards characterizing the temporal variations of the connectivity of growing multiplex networks, as well as predicting their future structural properties.