{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:37:47Z","timestamp":1747190267233,"version":"3.40.5"},"reference-count":54,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,10,30]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1155\/2020\/8796360","type":"journal-article","created":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T19:20:14Z","timestamp":1604172014000},"page":"1-11","source":"Crossref","is-referenced-by-count":5,"title":["Inverse Percolation to Quantify Robustness in Multiplex Networks"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8594-7006","authenticated-orcid":true,"given":"Edwin","family":"Montes-Orozco","sequence":"first","affiliation":[{"name":"Posgrado en Ciencias y Tecnolog\u00edas de la Informaci\u00f3n, Universidad Aut\u00f3noma Metropolitana Iztapalapa, Mexico City, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2112-7049","authenticated-orcid":true,"given":"Roman-Anselmo","family":"Mora-Guti\u00e9rrez","sequence":"additional","affiliation":[{"name":"Departamento de Sistemas, Universidad Aut\u00f3noma Metropolitana Azcapotzalco, Mexico City, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3079-3166","authenticated-orcid":true,"given":"Bibiana","family":"Obreg\u00f3n-Quintana","sequence":"additional","affiliation":[{"name":"Facultad de Ciencias, Universidad Nacional Aut\u00f3noma de M\u00e9xico, Mexico City, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1262-6310","authenticated-orcid":true,"given":"Sergio-G.","family":"de-los-Cobos-Silva","sequence":"additional","affiliation":[{"name":"Departamento de Ingenier\u00eda El\u00e9ctrica, Universidad Aut\u00f3noma Metropolitana Iztapalapa, Mexico City, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7837-7818","authenticated-orcid":true,"given":"Eric A.","family":"Rinc\u00f3n-Garc\u00eda","sequence":"additional","affiliation":[{"name":"Departamento de Ingenier\u00eda El\u00e9ctrica, Universidad Aut\u00f3noma Metropolitana Iztapalapa, Mexico City, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8596-8234","authenticated-orcid":true,"given":"Pedro","family":"Lara-Vel\u00e1zquez","sequence":"additional","affiliation":[{"name":"Departamento de Ingenier\u00eda El\u00e9ctrica, Universidad Aut\u00f3noma Metropolitana Iztapalapa, Mexico City, Mexico"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8633-8592","authenticated-orcid":true,"given":"Miguel A.","family":"Guti\u00e9rrez-Andrade","sequence":"additional","affiliation":[{"name":"Departamento de Ingenier\u00eda El\u00e9ctrica, Universidad Aut\u00f3noma Metropolitana Iztapalapa, Mexico City, Mexico"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-03518-5","volume-title":"Networks of Networks: The Last Frontier of Complexity","author":"G. D\u2019Agostino","year":"2014"},{"issue":"1549","key":"2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1098\/rspa.1971.0067","article-title":"Relations between the percolation and coloring problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the percolation problem","volume":"322","author":"H. N. Temperley","year":"1971","journal-title":"Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0184431"},{"article-title":"Clustering coefficients in multiplex networks","year":"2013","author":"E. Cozzo","key":"4"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2015-50742-1"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0193821"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1126\/science.1184819"},{"key":"8","first-page":"327","article-title":"Qs intelligence unit-international indicators","volume-title":"International Indicators","author":"Unit QI","year":"2017"},{"volume-title":"Direcci\u00f3n general de evaluaci\u00f3n institucional","year":"2020","author":"U. ExECUM-Estudio Comparativo de Universidades","key":"9"},{"key":"10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-030-29973-6_10","article-title":"Mexican university ranking based on maximal clique","volume-title":"Educational Networking","author":"E. Montes-Orozco","year":"2020"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0195539"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2010.00785.x"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/s003614450342480"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2009.02.001"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.71.015103"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1009440108"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/tcns.2015.2413551"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9826243"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5659687"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1038\/nature14604"},{"key":"21","article-title":"Methodology to quantify the robustness in networks. Case study: higher education system in Mexico","volume-title":"Computing, Page Forthcoming","author":"E. Montes-Orozco","year":"2020"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2016.02.002"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms7864"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.118.218301"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.94.012303"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1038\/nphys3097"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1038\/srep44359"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aa7b09"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124382"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-017-01442-2"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3007726"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu038"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.2307\/2785979"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj109"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(87)90009-8"},{"key":"36","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199242726.001.0001","volume-title":"The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership","author":"E. Lazega","year":"2001"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"issue":"1","key":"38","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"P. Erd\u00f6s","year":"1960","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1103\/revmodphys.74.47"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1027\/1866-5888\/a000023"},{"volume-title":"On the Generalized Distance in Statistics","year":"1936","author":"P. C. Mahalanobis","key":"42"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.94.060301"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.3390\/bdcc3030045"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0574-7"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1007\/bf02257778"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9943-4"},{"volume-title":"Metaheuristics for Hard Optimization: Methods and Case Studies","year":"2006","author":"J. Dr\u00e9o","key":"48"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.117"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1023\/a:1008202821328"},{"key":"52","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-319-23947-7_2","article-title":"Multilayer networks: metrics and spectral properties","volume-title":"Interconnected Networks","author":"E. Cozzo","year":"2016"},{"key":"53","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2012.11.003"},{"key":"54","doi-asserted-by":"crossref","DOI":"10.1017\/nws.2017.7","article-title":"Opinion-based centrality in multiplex networks: a convex optimization approach","author":"A. Reiffers-Masson","year":"2017"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8796360.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8796360.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/8796360.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T19:20:21Z","timestamp":1604172021000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/8796360\/"}},"subtitle":[],"editor":[{"given":"Vincent","family":"Labatut","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":54,"alternative-id":["8796360","8796360"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8796360","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2020,10,30]]}}}