Bond and site color-avoiding percolation in scale free networks
arXiv:1807.08553 · doi:10.1103/PhysRevE.98.062308
Abstract
Recently the problem of classes of vulnerable vertices (represented by colors) in complex networks has been discussed, where all vertices with the same vulnerability are prone to fail together. Utilizing redundant paths each avoiding one vulnerability (color), a robust color-avoiding connectivity is possible. However, many infrastructure networks show the problem of vulnerable classes of \textit{edges} instead of vertices. Here we formulate color-avoiding percolation for colored edges as well. Additionally, we allow for random failures of vertices or edges. The interplay of random failures and possible collective failures implies a rich phenomenology. A new form of critical behavior is found for networks with a power law degree distribution independent of the number of the colors, but still dependent on existence of the colors and therefore different from standard percolation. Our percolation framework fills a gap between different multilayer network percolation scenarios.
arXiv comment12 pages, 7 figures
References in corpus (27)
- Power-law distributions in empirical data
- Error and attack tolerance of complex networks
- Catastrophic cascade of failures in interdependent networks
- Random graphs with arbitrary degree distributions and their applications
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Critical phenomena in complex networks
- Breakdown of the Internet under intentional attack
- k-core organization of complex networks
- Percolation Critical Exponents in Scale-Free Networks
- Phase Transitions in the Coloring of Random Graphs
- Percolation in Multiplex Networks with Overlap
- k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
- Statistical ensemble of scale-free random graphs
- Continuum percolation of wireless ad hoc communication networks
- Predicting percolation thresholds in networks
- Bond percolation on multiplex networks
- Weak percolation on multiplex networks
- Correlated Edge Overlaps in Multiplex Networks
- First- and second-order phase transitions in scale-free networks
- Bicomponents and the robustness of networks to failure
- Breaking of the site-bond percolation universality in networks
- Phase Transition with the Berezinskii--Kosterlitz--Thouless Singularity in the Ising Model on a Growing Network
- Color-avoiding percolation
- Optimal redundancy against disjoint vulnerabilities in networks
- Critical field-exponents for secure message-passing in modular networks
- Underestimating extreme events in power-law behavior due to machine-dependent cutoffs