Stability of a Giant Connected Component in a Complex Network
Physics and Society
2018-01-24 v2 Statistical Mechanics
Abstract
We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.
Cite
@article{arxiv.1709.10174,
title = {Stability of a Giant Connected Component in a Complex Network},
author = {Maksim Kitsak and Alexander A. Ganin and Daniel A. Eisenberg and Pavel L. Krapivsky and Dmitri Krioukov and David L. Alderson and Igor Linkov},
journal= {arXiv preprint arXiv:1709.10174},
year = {2018}
}