Percolation on feature-enriched interconnected systems
arXiv:2104.14893 · doi:10.1038/s41467-021-22721-z
Abstract
Percolation is an emblematic model to assess the robustness of interconnected systems when some of their components are corrupted. It is usually investigated in simple scenarios, such as the removal of the system's units in random order, or sequentially ordered by specific topological descriptors. However, in the vast majority of empirical applications, it is required to dismantle the network following more sophisticated protocols, for instance, by combining topological properties and non-topological node metadata. We propose a novel mathematical framework to fill this gap: networks are enriched with features and their nodes are removed according to the importance in the feature space. We consider features of different nature, from ones related to the network construction to ones related to dynamical processes such as epidemic spreading. Our framework not only provides a natural generalization of percolation but, more importantly, offers an accurate way to test the robustness of networks in realistic scenarios.
arXiv comment16 pages (+7 Suppl. Mat.), 6 figures (+6 Suppl. Mat.)
References in corpus (34)
- Emergence of scaling in random networks
- Error and attack tolerance of complex networks
- Catastrophic cascade of failures in interdependent networks
- Epidemic processes in complex networks
- Random graphs with arbitrary degree distributions and their applications
- The structure and dynamics of multilayer networks
- Network robustness and fragility: Percolation on random graphs
- Networks beyond pairwise interactions: structure and dynamics
- Influence maximization in complex networks through optimal percolation
- Mathematical Formulation of Multi-Layer Networks
- Data-driven discovery of coordinates and governing equations
- Scale-free networks are rare
- Assessing the risks of "infodemics" in response to COVID-19 epidemics
- Avalanche Collapse of Interdependent Network
- Percolation Critical Exponents in Scale-Free Networks
- A Bayesian machine scientist to aid in the solution of challenging scientific problems
- Message passing on networks with loops
- Heterogeneous Bond Percolation on Multitype Networks with an Application to Epidemic Dynamics
- Complex networks vulnerability to module-based attacks
- An efficient approach of controlling traffic congestion in scale-free networks
- The interdependent network of gene regulation and metabolism is robust where it needs to be
- Breaking of the site-bond percolation universality in networks
- Tricritical point in heterogeneous k-core percolation
- Properties of Random Graphs with Hidden Color
- Minimal mechanisms for vegetation patterns in semiarid regions
- Transport on weighted Networks: when correlations are independent of degree
- Dynamics on networks: competition of temporal and topological correlations
- Asymmetric percolation drives a double transition in sexual contact networks
- Aging-induced continuous phase transition
- Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks
- Effectiveness of dismantling strategies on moderated vs. unmoderated online social platforms
- Abrupt transition due to non-local cascade propagation in multiplex systems
- Network depth: identifying median and contours in complex networks
- Beyond Fortune 500: Women in a Global Network of Directors
Cited by in corpus (6)
- Robustness and resilience of complex networks
- From the origin of life to pandemics: Emergent phenomena in complex systems
- Multilayer Network Science: from Cells to Societies
- Self-organized explosive synchronization in complex networks: Emergence of synchronization bombs
- Non-Markovian random walks characterize network robustness to nonlocal cascades
- Site and bond percolation in linearly distorted triangular and square lattices