Berlin 2018 – wissenschaftliches Programm
Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
DY: Fachverband Dynamik und Statistische Physik
DY 37: Networks: From Topology to Dynamics (joint session SOE/DY/BP) (joint session SOE/CPP/BP/DY)
DY 37.3: Vortrag
Mittwoch, 14. März 2018, 10:00–10:15, MA 001
Robust connectivity in networks with groups of vulnerable nodes — •Sebastian M. Krause1,2, Michael M. Danziger3, and Vinko Zlatić2 — 1Faculty of Physics, University of Duisburg-Essen, Lotharstr. 1, 47048 Duisburg, Germany — 2Theoretical Physics Division, Rudjer Bošković Institute, Bijenicka c. 54, 10000 Zagreb, Croatia — 3Department of Physics, Bar-Ilan University, Ramat Gan 5290002, Israel
In many networked systems there are large groups of similar nodes which are vulnerable to the same failure or adversary. For example, servers in a communication network running the same software will fail together, if this software has a bug. Therefore, we are often faced with networks where all nodes of a group can fail together. Further, many different vulnerabilities can cover the whole network. This structural weakness has so far been overlooked in studies of network robustness. Here we discuss, how multiple redundant paths enable a high level of robustness, even if no node is trusted [1,2]. With each vulnerability described as a color, we discuss "color-avoiding percolation". We present a fast numerical algorithm for real world networks and analytical results for random network ensembles.
[1] Sebastian M. Krause, Michael M. Danziger, and Vinko Zlatić, Hidden Connectivity in Networks with Vulnerable Classes of Nodes, Phys. Rev. X 6, 041022 (2016).
[2] S. M. Krause, M. M. Danziger, and V. Zlatić, Color-avoiding percolation, Phys. Rev. E 96 022313 (2017).