 Communities Detection in Multiplex Networks Using Optimization: Study Case—Employment in Mexico during the COVID-19 PandemicEdwin Montes-Orozco, Roman Anselmo Mora-Gutiérrez, Sergio Gerardo De-Los-Cobos-Silva, Roberto Bernal-Jaquez, Eric Alfredo Rincón-GarcÃa, Miguel Angel Gutiérrez-Andrade, Pedro Lara-Velázquez and Zhen Zhang Complexity, 2023, vol. 2023, 1-14 Abstract: The detection of communities in complex networks offers important information about the structure of the network as well as its dynamics. However, it is not an easy problem to solve. This work presents a methodology based of the robust coloring problem (RCP) and the vertex cover problem (VCP) to find communities in multiplex networks. For this, we consider the RCP idea of having a partial detection based onf the similarity of connected and unconnected nodes. On the other hand, with the idea of the VCP, we manage to minimize the number of groups, which allows us to identify the communities well. To apply this methodology, we present the dynamic characterization of job loss, change, and acquisition behavior for the Mexican population before and during the COVID-19 pandemic modeled as a 4- layer multiplex network. The results obtained when applied to test and study case networks show that this methodology can classify elements with similar characteristics and can find their communities. Therefore, our proposed methodology can be used as a new mechanism to identify communities, regardless of the topology or whether it is a monoplex or multiplex network. Date: 2023 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9011738 DOI: 10.1155/2023/9011738 Access Statistics for this article More articles in Complexity from Hindawi |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.