Multiplex networks with heterogeneous activities of the nodes
arXiv:1505.01220 · doi:10.1103/PhysRevE.93.032302
Abstract
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.
arXiv comment9 pages, 9 figures
References in corpus (33)
- Catastrophic cascade of failures in interdependent networks
- Multilayer Networks
- The structure and dynamics of multilayer networks
- Critical phenomena in complex networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Multirelational Organization of Large-scale Social Networks in an Online World
- Mathematical Formulation of Multi-Layer Networks
- Interdependent networks: Reducing the coupling strength leads to a change from a first to second order percolation transition
- Structural measures for multiplex networks
- Robustness of a Network of Networks
- Emergence of network features from multiplexity
- Avalanche Collapse of Interdependent Network
- Entropy measures for complex networks: Toward an information theory of complex topologies
- Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap
- Growing multiplex networks
- Cut-offs and finite size effects in scale-free networks
- Avoiding catastrophic failure in correlated networks of networks
- Network robustness of multiplex networks with interlayer degree correlations
- Measuring and modelling correlations in multiplex networks
- Percolation Theory on Interdependent Networks Based on Epidemic Spreading
- Percolation in Multiplex Networks with Overlap
- Robustness of a Tree-like Network of Interdependent Networks
- Weighted Multiplex Networks
- Multiple percolation transitions in a configuration model of network of networks
- k-Core percolation on multiplex networks
- Gibbs entropy of networks ensembles by cavity methods
- Weak percolation on multiplex networks
- Entropies of complex networks with hierarchically constrained topologies
- Reconstructing the world trade multiplex: the role of intensive and extensive biases
- Mutually connected component of network of networks with replica nodes
- Percolation on interacting, antagonistic networks
- Cavity-based robustness analysis of interdependent networks: Influences of intranetwork and internetwork degree-degree correlations
- Efficient algorithm to compute mutually connected components in interdependent networks
Cited by in corpus (13)
- Measuring and modelling correlations in multiplex networks
- The new challenges of multiplex networks: measures and models
- Message passing theory for percolation models on multiplex networks with link overlap
- Optimal percolation on multiplex networks
- Centralities of Nodes and Influences of Layers in Large Multiplex Networks
- Multilink Communities of Multiplex Networks
- Extracting Information from Multiplex Networks
- Percolation in real multiplex networks
- Clustering determines the dynamics of complex contagions in multiplex networks
- Associative nature of event participation dynamics: a network theory approach
- Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions
- Observability transition in multiplex networks
- LayerPlexRank: Exploring Node Centrality and Layer Influence through Algebraic Connectivity in Multiplex Networks