IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v523y2019icp593-601.html
   My bibliography  Save this article

A robust complex network generation method based on neural networks

Author

Listed:
  • Sohn, Insoo

Abstract

To enhance the network tolerance against numerous network attack strategies, various techniques to optimize conventional complex networks, such as scale-free networks, have been proposed. In this paper, we propose a new optimization technique based on artificial neural networks that is trained on scale-free network topologies as input data and hill climbing network topologies as output data. The goal of our method is to provide similar network robustness as the hill climbing network with much reduced complexity. Based on the experimental results, we demonstrate that the proposed network can provide strong robustness against both random and targeted attack, while significantly reduce optimization complexity.

Suggested Citation

  • Sohn, Insoo, 2019. "A robust complex network generation method based on neural networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 593-601.
    • Handle: RePEc:eee:phsmap:v:523:y:2019:i:c:p:593-601
    DOI: 10.1016/j.physa.2019.02.046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119301992
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2019.02.046?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Duan, Boping & Liu, Jing & Zhou, Mingxing & Ma, Liangliang, 2016. "A comparative analysis of network robustness against different link attacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 448(C), pages 144-153.
    2. Crucitti, Paolo & Latora, Vito & Marchiori, Massimo & Rapisarda, Andrea, 2004. "Error and attack tolerance of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 340(1), pages 388-394.
    3. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    4. Andre A. Moreira & Jose S. Andrade Jr. & Hans J. Herrmann & Joseph O. Indekeu, "undated". "How to make a fragile network robust and vice versa," Working Papers CCSS-09-001, ETH Zurich, Chair of Systems Design.
    5. R. Kinney & P. Crucitti & R. Albert & V. Latora, 2005. "Modeling cascading failures in the North American power grid," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 46(1), pages 101-107, July.
    6. Hong, Chen & He, Ning & Lordan, Oriol & Liang, Bo-Yuan & Yin, Nai-Yu, 2017. "Efficient calculation of the robustness measure R for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 478(C), pages 63-68.
    7. E. Estrada, 2006. "Network robustness to targeted attacks. The interplay of expansibility and degree distribution," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 52(4), pages 563-574, August.
    8. Crucitti, Paolo & Latora, Vito & Marchiori, Massimo & Rapisarda, Andrea, 2003. "Efficiency of scale-free networks: error and attack tolerance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 320(C), pages 622-642.
    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. Meng, Yangyang & Tian, Xiangliang & Li, Zhongwen & Zhou, Wei & Zhou, Zhijie & Zhong, Maohua, 2020. "Comparison analysis on complex topological network models of urban rail transit: A case study of Shenzhen Metro in China," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 559(C).

    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. Hao, Yucheng & Jia, Limin & Wang, Yanhui, 2020. "Edge attack strategies in interdependent scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    2. Gao, Yan-Li & Chen, Shi-Ming & Nie, Sen & Ma, Fei & Guan, Jun-Jie, 2018. "Robustness analysis of interdependent networks under multiple-attacking strategies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 495-504.
    3. Zhao, Jianyu & Wei, Jiang & Yu, Lean & Xi, Xi, 2022. "Robustness of knowledge networks under targeted attacks: Electric vehicle field of China evidence," Structural Change and Economic Dynamics, Elsevier, vol. 63(C), pages 367-382.
    4. Alice Paul & Susan E. Martonosi, 2024. "The all-pairs vitality-maximization (VIMAX) problem," Annals of Operations Research, Springer, vol. 338(2), pages 1019-1048, July.
    5. Morehead, Raymond & Noore, Afzel, 2007. "Novel hybrid mitigation strategy for improving the resiliency of hierarchical networks subjected to attacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(2), pages 603-612.
    6. Duan, Boping & Liu, Jing & Zhou, Mingxing & Ma, Liangliang, 2016. "A comparative analysis of network robustness against different link attacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 448(C), pages 144-153.
    7. Kashyap, G. & Ambika, G., 2019. "Link deletion in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 631-643.
    8. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    9. Kim, Dong Hwan & Eisenberg, Daniel A. & Chun, Yeong Han & Park, Jeryang, 2017. "Network topology and resilience analysis of South Korean power grid," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 13-24.
    10. Lv, Changchun & Yuan, Ziwei & Si, Shubin & Duan, Dongli, 2021. "Robustness of scale-free networks with dynamical behavior against multi-node perturbation," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    11. Liu, Qing & Yang, Yang & Ng, Adolf K.Y. & Jiang, Changmin, 2023. "An analysis on the resilience of the European port network," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).
    12. Iovanella, Antonio, 2024. "Exploiting network science in business process management: A conceptual framework," Chaos, Solitons & Fractals, Elsevier, vol. 178(C).
    13. Ma, Xiangyu & Zhou, Huijie & Li, Zhiyi, 2021. "On the resilience of modern power systems: A complex network perspective," Renewable and Sustainable Energy Reviews, Elsevier, vol. 152(C).
    14. Matteo Cinelli & Giovanna Ferraro & Antonio Iovanella, 2017. "Resilience of Core-Periphery Networks in the Case of Rich-Club," Complexity, Hindawi, vol. 2017, pages 1-12, December.
    15. Saniee Monfared, Momhammad Ali & Jalili, Mahdi & Alipour, Zohreh, 2014. "Topology and vulnerability of the Iranian power grid," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 406(C), pages 24-33.
    16. Lv, Changchun & Yuan, Ziwei & Si, Shubin & Duan, Dongli & Yao, Shirui, 2022. "Cascading failure in networks with dynamical behavior against multi-node removal," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    17. Ghedini, Cinara G. & Ribeiro, Carlos H.C., 2011. "Rethinking failure and attack tolerance assessment in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4684-4691.
    18. Quayle, A.P. & Siddiqui, A.S. & Jones, S.J.M., 2006. "Preferential network perturbation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 823-840.
    19. Bellingeri, Michele & Cassi, Davide & Vincenzi, Simone, 2014. "Efficiency of attack strategies on complex model and real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 414(C), pages 174-180.
    20. Valentini, Luca & Perugini, Diego & Poli, Giampiero, 2007. "The “small-world” topology of rock fracture networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 377(1), pages 323-328.

    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:eee:phsmap:v:523:y:2019:i:c:p:593-601. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.