IDEAS home Printed from https://ideas.repec.org/a/wly/complx/v2022y2022i1n2951744.html

Analysis and Characterization of the Spread of COVID‐19 in Mexico through Complex Networks and Optimization Approaches

Author

Listed:
  • Edwin Montes-Orozco
  • Roman-Anselmo Mora-Gutiérrez
  • Sergio-Gerardo de-los-Cobos-Silva
  • Eric A. Rincón-García
  • Miguel A. Gutiérrez-Andrade
  • Pedro Lara-Velázquez

Abstract

This work analyzes and characterizes the spread of the COVID‐19 disease in Mexico, using complex networks and optimization approaches. Specifically, we present two methodologies based on the principle of the rupture for the GC and Newton's law of motion to quantify the robustness and identify the Mexican municipalities whose population causes a fast spread of the SARS‐CoV‐2 virus. Specifically, the first methodology is based on several characteristics of the original version of the Vertex Separator Problem (VSP), and the second is based on a new mathematical model (NLM). By solving VSP, we can find nodes that cause the rupture of the giant component (GC). On the other hand, solving the NLM can find more influential nodes for the entire system’s development. Specifically, we present an analysis using a coupled social network model with information about the main characteristics of the contagion and deaths caused by COVID‐19 in Mexico for 19 months (January 2020–July 2021). This work aims to show through the approach of complex networks how the spread of the disease behaves, and, thus, researchers from other areas can delve into the characteristics that cause this behavior.

Suggested Citation

  • Edwin Montes-Orozco & Roman-Anselmo Mora-Gutiérrez & Sergio-Gerardo de-los-Cobos-Silva & Eric A. Rincón-García & Miguel A. Gutiérrez-Andrade & Pedro Lara-Velázquez, 2022. "Analysis and Characterization of the Spread of COVID‐19 in Mexico through Complex Networks and Optimization Approaches," Complexity, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:complx:v:2022:y:2022:i:1:n:2951744
    DOI: 10.1155/2022/2951744
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/2951744
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/2951744?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Linyuan Lü & Yi-Cheng Zhang & Chi Ho Yeung & Tao Zhou, 2011. "Leaders in Social Networks, the Delicious Case," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-9, June.
    2. repec:plo:pone00:0195539 is not listed on IDEAS
    3. Xiao-Long Ren & Niels Gleinig & Dijana Tolić & Nino Antulov-Fantulin, 2018. "Underestimated Cost of Targeted Attacks on Complex Networks," Complexity, Hindawi, vol. 2018, pages 1-15, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Edwin Montes-Orozco & Roman-Anselmo Mora-Gutiérrez & Roberto Bernal-Jaquez & Daniela Aguirre-Guerrero, 2025. "Analysis of Violence Patterns in Mexico: A Complex Temporal Networks Approach," Complexity, John Wiley & Sons, vol. 2025(1).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xing Tang & Qiguang Miao & Shangshang Yu & Yining Quan, 2016. "A Data-Based Approach to Discovering Multi-Topic Influential Leaders," PLOS ONE, Public Library of Science, vol. 11(7), pages 1-14, July.
    2. Chaocheng He & Jiang Wu & Qingpeng Zhang, 2021. "Characterizing research leadership on geographically weighted collaboration network," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(5), pages 4005-4037, May.
    3. Xipeng Liu & Xinmiao Li, 2024. "Unbiased evaluation of ranking algorithms applied to the Chinese green patents citation network," Scientometrics, Springer;Akadémiai Kiadó, vol. 129(6), pages 2999-3021, June.
    4. Wu, Yali & Dong, Ang & Ren, Yuanguang & Jiang, Qiaoyong, 2023. "Identify influential nodes in complex networks: A k-orders entropy-based method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P1).
    5. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    6. Zhu, Xiaoyu & Hao, Rongxia, 2024. "Identifying influential nodes in social networks via improved Laplacian centrality," Chaos, Solitons & Fractals, Elsevier, vol. 189(P1).
    7. Zhang, Wei & Cao, Juyang & Mariani, Manuel Sebastian & Wang, Zhen-Zhen & Zhou, Mingyang & Chen, Wei & Liao, Hao, 2024. "Uncovering milestone papers: A network diffusion and game theory approach," Journal of Informetrics, Elsevier, vol. 18(3).
    8. Yu, Yong & Jing, Ming & Zhao, Na & Zhou, Tao, 2025. "Lowest degree decomposition of complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 199(P3).
    9. Gong Kai & Kang Li, 2018. "A New K-Shell Decomposition Method for Identifying Influential Spreaders of Epidemics on Community Networks," Journal of Systems Science and Information, De Gruyter, vol. 6(4), pages 366-375, August.
    10. Atdag, Samet & Bingol, Haluk O., 2021. "Computational models for commercial advertisements in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    11. Zhu, Xiaoyu & Hao, Rongxia, 2025. "Finding influential nodes in complex networks by integrating nodal intrinsic and extrinsic centrality," Chaos, Solitons & Fractals, Elsevier, vol. 194(C).
    12. Qu, Hongbo & Song, Yu-Rong & Li, Ruqi & Li, Min, 2023. "GNR: A universal and efficient node ranking model for various tasks based on graph neural networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 632(P2).
    13. Xu, Shuqi & Mariani, Manuel Sebastian & Lü, Linyuan & Medo, Matúš, 2020. "Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data," Journal of Informetrics, Elsevier, vol. 14(1).
    14. Mingyue Kong & Yinglong Zhang & Likun Sheng & Kaifeng Hong, 2025. "Citation structural diversity: a novel metric combining structure and semantics for literature evaluation," Scientometrics, Springer;Akadémiai Kiadó, vol. 130(7), pages 4027-4060, July.
    15. Xiaojie Wang & Xue Zhang & Chengli Zhao & Dongyun Yi, 2016. "Maximizing the Spread of Influence via Generalized Degree Discount," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-16, October.
    16. Teqi Dai & Tiantian Ding & Qingfang Liu & Bingxin Liu, 2022. "Node Centrality Comparison between Bus Line and Passenger Flow Networks in Beijing," Sustainability, MDPI, vol. 14(22), pages 1-14, November.
    17. Li, Zhe & Liu, Jin & Ren, Jiaqi & Dong, Yibo & Li, Weili, 2024. "Application of hybrid strategies of complex network attack and defense games," Chaos, Solitons & Fractals, Elsevier, vol. 189(P1).
    18. Zhong, Li-Xin & Xu, Wen-Juan & Shi, Yong-Dong & Qiu, Tian, 2013. "Coupled dynamics of mobility and pattern formation in optional public goods games," Chaos, Solitons & Fractals, Elsevier, vol. 47(C), pages 18-26.
    19. Young-Ho Eom & Pablo Aragón & David Laniado & Andreas Kaltenbrunner & Sebastiano Vigna & Dima L Shepelyansky, 2015. "Interactions of Cultures and Top People of Wikipedia from Ranking of 24 Language Editions," PLOS ONE, Public Library of Science, vol. 10(3), pages 1-27, March.
    20. Wandelt, Sebastian & Chen, Xinyue & Sun, Xiaoqian, 2025. "Recent advances in network dismantling: A comprehensive review and list of recommendations for future work," Chaos, Solitons & Fractals, Elsevier, vol. 199(P2).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:complx:v:2022:y:2022:i:1:n:2951744. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/8503 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.