Bond and site color-avoiding percolation in scale free networks

Autor: Guido Caldarelli, Andrea Kadović, Sebastian M. Krause, Vinko Zlatić
Rok vydání: 2018
Předmět:
Power law degree distribution
Physics - Physics and Society
Computer science
percolation
complex network
color graph
avoiding vulnerabilities
FOS: Physical sciences
Physics and Society (physics.soc-ph)
01 natural sciences
010305 fluids & plasmas
0103 physical sciences
Statistical physics
010306 general physics
multiplexes
colored networks
critical infrastructure
traffic networks
Condensed Matter - Statistical Mechanics
Vulnerability (computing)
Statistical Mechanics (cond-mat.stat-mech)
Physics
Bond
Scale-free network
Disordered Systems and Neural Networks (cond-mat.dis-nn)
Complex network
Condensed Matter - Disordered Systems and Neural Networks
Physik (inkl. Astronomie)
Condensed Matter Physics
Settore FIS/02 - Fisica Teorica
Modelli e Metodi Matematici

Colored
Percolation
Phenomenology (particle physics)
MathematicsofComputing_DISCRETEMATHEMATICS
Zdroj: Physical Review E
DOI: 10.48550/arxiv.1807.08553
Popis: 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.
Comment: 12 pages, 7 figures
Databáze: OpenAIRE