IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v170y2020icp379-409.html
   My bibliography  Save this article

Robustness on topology reconfiguration of complex networks: An entropic approach

Author

Listed:
  • Safaei, F.
  • Yeganloo, H.
  • Akbar, R.

Abstract

Study on complex networks illustrates systems of real-world in disparate realms that incorporates a range of biological networks to technological systems and has, over the past years, become one of the most important and fascinating fields of the interdisciplinary research center. These complex networks share many topological features such as the small-worldness, scale-freeness, the existence of motifs and graphlets and self-similarity. In most cases, complex and real-networks are very large, and the description and analysis of them in explicit form is often faced with difficulty. We manage to head off aforementioned troubles by examining successful models amongst communication networks in some particular aspects, including important factors such as cost, security, integrity, scalability, and fault tolerant. The last factor is distinctly important for each communication network. Recently, some methods and mechanisms have been proposed to increase and improve the robustness of network by modifying its topology. The rewiring is the mechanism amongst the defensive strategies to increase the resilience of attacked networks in which the affected nodes are disconnected from faulty nodes and, possibly, connect to another profitable node with a specific probability. In this paper, a rewiring mechanism based on Shannon entropy concept is proposed to streamline the complex networks configuration in order to improve their resiliency. Network entropy is a quantitative criterion for describing its robustness and is acknowledged as one of the topological characteristic criteria. In practice, this quantity is related to the capacity of the network to tolerate changes in its configuration under various environmental constraints. We evaluate the network robustness based on the spectrum of degree distribution, heterogeneity, as well as the average size of the largest connected cluster during removing nodes with a sequence of systematic attacks based on the degree, betweenness, and Dangalchev’s closeness centralities. The proposed rewiring strategy is applied over six synthetic networks and six real datasets, and then we verified that through approximately 30% swapping of links, the overall robustness of networks can be reached.

Suggested Citation

  • Safaei, F. & Yeganloo, H. & Akbar, R., 2020. "Robustness on topology reconfiguration of complex networks: An entropic approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 170(C), pages 379-409.
  • Handle: RePEc:eee:matcom:v:170:y:2020:i:c:p:379-409
    DOI: 10.1016/j.matcom.2019.11.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475419303477
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2019.11.013?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. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    2. Zhongyuan Jiang & Mangui Liang & Dongchao Guo, 2011. "Enhancing Network Performance By Edge Addition," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 22(11), pages 1211-1226.
    3. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    4. Zadorozhnyi, V.N. & Yudin, E.B., 2015. "Growing network: Models following nonlinear preferential attachment rule," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 428(C), pages 111-132.
    5. T. S. Evans, 2007. "Exact solutions for network rewiring models," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 56(1), pages 65-69, March.
    6. Xu, Xin-Jian & Hu, Xiao-Ming & Zhang, Li-Jie, 2011. "Network evolution by nonlinear preferential rewiring of edges," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(12), pages 2429-2434.
    7. 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.
    8. Yang, Xu-Hua & Chen, Guang & Chen, Sheng-Yong, 2013. "The impact of connection density on scale-free distribution in random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2547-2554.
    9. Mukwembi, Simon, 2011. "Effects of density of infected population to the spreading of HIV epidemic in communities," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(21), pages 3915-3921.
    10. Xie, Yan-Bo & Zhou, Tao & Wang, Bing-Hong, 2008. "Scale-free networks without growth," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(7), pages 1683-1688.
    11. Li, Xueliang & Qin, Zhongmei & Wei, Meiqin & Gutman, Ivan & Dehmer, Matthias, 2015. "Novel inequalities for generalized graph entropies – Graph energies and topological indices," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 470-479.
    12. Dangalchev, Chavdar, 2006. "Residual closeness in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 365(2), pages 556-564.
    13. Eocman Lee & Jeho Lee & Jongseok Lee, 2006. "Reconsideration of the Winner-Take-All Hypothesis: Complex Networks and Local Bias," Management Science, INFORMS, vol. 52(12), pages 1838-1848, December.
    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. Wenyan Wang & Jun Zhang & Fang Zhou & Peng Chen & Bing Wang, 2021. "Paper acceptance prediction at the institutional level based on the combination of individual and network features," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(2), pages 1581-1597, February.

    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. Yang, Xu-Hua & Lou, Shun-Li & Chen, Guang & Chen, Sheng-Yong & Huang, Wei, 2013. "Scale-free networks via attaching to random neighbors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(17), pages 3531-3536.
    2. Christina Fang & Jeho Lee & Melissa A. Schilling, 2010. "Balancing Exploration and Exploitation Through Structural Design: The Isolation of Subgroups and Organizational Learning," Organization Science, INFORMS, vol. 21(3), pages 625-642, June.
    3. Mahyar, Hamidreza & Hasheminezhad, Rouzbeh & Ghalebi K., Elahe & Nazemian, Ali & Grosu, Radu & Movaghar, Ali & Rabiee, Hamid R., 2018. "Compressive sensing of high betweenness centrality nodes in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 166-184.
    4. Katya Pérez-Guzmán & Isela-Elizabeth Téllez-León & Ali Kharrazi & Brian Fath & Francisco Venegas-Martínez, 2018. "What makes Input-Output Tables of Trade of Raw Material Goods Peculiar Networks? The World and Mexican Cases," Remef - Revista Mexicana de Economía y Finanzas Nueva Época REMEF (The Mexican Journal of Economics and Finance), Instituto Mexicano de Ejecutivos de Finanzas, IMEF, vol. 13(4), pages 483-505, Octubre-D.
    5. Salavati, Chiman & Abdollahpouri, Alireza & Manbari, Zhaleh, 2018. "BridgeRank: A novel fast centrality measure based on local structure of the network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 635-653.
    6. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    7. Hu, Jianqiang & Yu, Jie & Cao, Jinde & Ni, Ming & Yu, Wenjie, 2014. "Topological interactive analysis of power system and its communication module: A complex network approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 99-111.
    8. Feng Su & Peijiang Yuan & Yuanwei Liu & Shuangqian Cao, 2018. "Network topology optimization by turning non-scale-free networks into scale-free networks using nonlinear preferential rewiring method," International Journal of Distributed Sensor Networks, , vol. 14(11), pages 15501477187, November.
    9. Jiang, Zhong-Yuan & Zeng, Yong & Liu, Zhi-Hong & Ma, Jian-Feng, 2019. "Identifying critical nodes’ group in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 121-132.
    10. Guijie Zhang & Luning Liu & Yuqiang Feng & Zhen Shao & Yongli Li, 2014. "Cext-N index: a network node centrality measure for collaborative relationship distribution," Scientometrics, Springer;Akadémiai Kiadó, vol. 101(1), pages 291-307, October.
    11. Emerson, I. Arnold & Gothandam, K.M., 2012. "Network analysis of transmembrane protein structures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(3), pages 905-916.
    12. Ebadi, Ashkan & Schiffauerova, Andrea, 2015. "How to become an important player in scientific collaboration networks?," Journal of Informetrics, Elsevier, vol. 9(4), pages 809-825.
    13. Zhong, Weicai & Liu, Jing, 2012. "Comments on “Scale-free networks without growth”," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(5), pages 2163-2165.
    14. Colman, E.R. & Rodgers, G.J., 2014. "Local rewiring rules for evolving complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 80-89.
    15. Chen, Duanbing & Lü, Linyuan & Shang, Ming-Sheng & Zhang, Yi-Cheng & Zhou, Tao, 2012. "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1777-1787.
    16. Zhao, Zi-Juan & Guo, Qiang & Yu, Kai & Liu, Jian-Guo, 2020. "Identifying influential nodes for the networks with community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 551(C).
    17. Jeho Lee & Jaeyong Song & Jae-Suk Yang, 2016. "Network structure effects on incumbency advantage," Strategic Management Journal, Wiley Blackwell, vol. 37(8), pages 1632-1648, August.
    18. Mishkovski, Igor & Righero, Marco & Biey, Mario & Kocarev, Ljupco, 2011. "Enhancing robustness and synchronizability of networks homogenizing their degree distribution," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4610-4620.
    19. Wen, Xing-Zhang & Zheng, Yue & Du, Wen-Li & Ren, Zhuo-Ming, 2023. "Regulating clustering and assortativity affects node centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
    20. De Masi, G. & Giovannetti, G. & Ricchiuti, G., 2013. "Network analysis to detect common strategies in Italian foreign direct investment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(5), pages 1202-1214.

    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:matcom:v:170:y:2020:i:c:p:379-409. 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/mathematics-and-computers-in-simulation/ .

    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.