Inverse Percolation to Quantify Robustness in Multiplex Networks

被引:4
|
作者
Montes-Orozco, Edwin [1 ]
Mora-Gutierrez, Roman-Anselmo [2 ]
Obregon-Quintana, Bibiana [3 ]
de-los-Cobos-Silva, Sergio-G [4 ]
Rincon-Garcia, Eric A. [4 ]
Lara-Velazquez, Pedro [4 ]
Gutierrez-Andrade, Miguel A. [4 ]
机构
[1] Univ Autonoma Metropolitana Iztapalapa, Ciencias & Tecnol Informat, Mexico City, DF, Mexico
[2] Univ Autonoma Metropolitana Azcapotzalco, Dept Sistemas, Mexico City, DF, Mexico
[3] Univ Nacl Autonoma Mexico, Fac Ciencias, Mexico City, DF, Mexico
[4] Univ Autonoma Metropolitana Iztapalapa, Dept Ingn Elect, Mexico City, DF, Mexico
关键词
VERTEX SEPARATOR; OPTIMIZATION; EVOLUTION;
D O I
10.1155/2020/8796360
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Inverse percolation is known as the problem of finding the minimum set of nodes whose elimination of their links causes the rupture of the network. Inverse percolation has been widely used in various studies of single-layer networks. However, the use and generalization of multiplex networks have been little considered. In this work, we propose a methodology based on inverse percolation to quantify the robustness of multiplex networks. Specifically, we present a modified version of the mathematical model for the multiplex-vertex separator problem (m-VSP). By solving the m-VSP, we can find nodes that cause the rupture of the mutually connected giant component (MCGC) and the large viable cluster (LVC) when their links are removed from the network. The methodology presented in this work was tested in a set of benchmark networks, and as case study, we present an analysis using a set of multiplex social networks modeled with information about the main characteristics of the best universities in the world and the universities in Mexico. The results show that the methodology presented in this work can work in different models and types of 2- and 3-layer multiplex networks without dividing the entire multiplex network into single-layer as some techniques described in the specific literature. Furthermore, thanks to the fact that the technique does not require the calculation of some structural measure or centrality metric, and it is easy to scale for networks of different sizes.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Network Robustness Based on Inverse Percolation
    Sajadi, Farkhondeh Alsadat
    [J]. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, 2021, 45 (03): : 1005 - 1014
  • [2] Network Robustness Based on Inverse Percolation
    Farkhondeh Alsadat Sajadi
    [J]. Iranian Journal of Science and Technology, Transactions A: Science, 2021, 45 : 1005 - 1014
  • [3] Optimal percolation on multiplex networks
    Osat, Saeed
    Faqeeh, Ali
    Radicchi, Filippo
    [J]. NATURE COMMUNICATIONS, 2017, 8
  • [4] Percolation in multiplex networks with overlap
    Cellai, Davide
    Lopez, Eduardo
    Zhou, Jie
    Gleeson, James P.
    Bianconi, Ginestra
    [J]. PHYSICAL REVIEW E, 2013, 88 (05):
  • [5] Bond Percolation on Multiplex Networks
    Hackett, A.
    Cellai, D.
    Gomez, S.
    Arenas, A.
    Gleeson, J. P.
    [J]. PHYSICAL REVIEW X, 2016, 6 (02):
  • [6] Weak percolation on multiplex networks
    Baxter, Gareth J.
    Dorogovtsev, Sergey N.
    Mendes, Jose F. F.
    Cellai, Davide
    [J]. PHYSICAL REVIEW E, 2014, 89 (04):
  • [7] Percolation in real multiplex networks
    Bianconi, Ginestra
    Radicchi, Filippo
    [J]. PHYSICAL REVIEW E, 2016, 94 (06)
  • [8] Optimal percolation on multiplex networks
    Saeed Osat
    Ali Faqeeh
    Filippo Radicchi
    [J]. Nature Communications, 8
  • [9] Multiplex networks quantify robustness of the mental lexicon to catastrophic concept failures, aphasic degradation and ageing
    Stella, Massimo
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 554 (554)
  • [10] Bond percolation in coloured and multiplex networks
    Ivan Kryven
    [J]. Nature Communications, 10