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

Emergence of robust and efficient networks in a family of attachment models

Author

Listed:
  • Liao, Fuxuan
  • Hayashi, Yukio

Abstract

Self-organization of robust and efficient networks is important for the future designs of communication or transportation systems, because both characteristics are not coexisting in many real networks. As one of the candidates for the coexisting, the optimal robustness of onion-like structure with positive degree–degree correlations has recently been found, and it can be generated by incrementally growing methods based on a pair of random and intermediation attachments with the minimum degree selection. In this paper, we introduce a continuous interpolation by a parameter β≥0 between random and the minimum degree attachments to investigate the reason why the minimum degree selection is important. However, we find that the special case of the minimum degree attachment can generate highly robust networks but with low efficiency as a chain structure. Furthermore, we consider two intermediation models modified with the inverse preferential attachment for investigating the effect of distance on the emergence of robust onion-like structure. The inverse preferential attachments in a class of mixed attachment and two intermediation models are effective for the emergence of robust onion-like structure. However, a small amount of random attachment is necessary for the network efficiency, when β is large enough. Such attachment models indicate a prospective direction to the future growth of our network infrastructures.

Suggested Citation

  • Liao, Fuxuan & Hayashi, Yukio, 2022. "Emergence of robust and efficient networks in a family of attachment models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 599(C).
  • Handle: RePEc:eee:phsmap:v:599:y:2022:i:c:s0378437122003168
    DOI: 10.1016/j.physa.2022.127427
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437122003168
    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.2022.127427?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. 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.
    2. 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.
    3. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    4. Hayashi, Yukio, 2018. "A new design principle of robust onion-like networks self-organized in growth," Network Science, Cambridge University Press, vol. 6(1), pages 54-70, March.
    5. Lazaros K. Gallos & Shlomo Havlin & H. Eugene Stanley & Nina H. Fefferman, 2019. "Propinquity drives the emergence of network structure and density," Proceedings of the National Academy of Sciences, Proceedings of the National Academy of Sciences, vol. 116(41), pages 20360-20365, October.
    6. 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.
    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. Costantini, Mauro & Maaitah, Ahmad & Mishra, Tapas & Sousa, Ricardo M., 2023. "Bitcoin market networks and cyberattacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(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. Pi, Xiaochen & Tang, Longkun & Chen, Xiangzhong, 2021. "A directed weighted scale-free network model with an adaptive evolution mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    2. Wouter Vermeer & Otto Koppius & Peter Vervest, 2018. "The Radiation-Transmission-Reception (RTR) model of propagation: Implications for the effectiveness of network interventions," PLOS ONE, Public Library of Science, vol. 13(12), pages 1-21, December.
    3. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    4. 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.
    5. Heath Henderson & Arnob Alam, 2022. "The structure of risk-sharing networks," Empirical Economics, Springer, vol. 62(2), pages 853-886, February.
    6. Ying Duan & Xiuwen Fu & Wenfeng Li & Yu Zhang & Giancarlo Fortino, 2017. "Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks," Complexity, Hindawi, vol. 2017, pages 1-15, July.
    7. Chen, Chen & Lu, Jun-an & Wu, Xiaoqun, 2010. "Complex networks constructed from irrational number sequences," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(13), pages 2654-2662.
    8. Chen, Qinghua & Shi, Dinghua, 2006. "Markov chains theory for scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 360(1), pages 121-133.
    9. Lucas Cuadra & Sancho Salcedo-Sanz & Javier Del Ser & Silvia Jiménez-Fernández & Zong Woo Geem, 2015. "A Critical Review of Robustness in Power Grids Using Complex Networks Concepts," Energies, MDPI, vol. 8(9), pages 1-55, August.
    10. David L. Alderson, 2008. "OR FORUM---Catching the “Network Science” Bug: Insight and Opportunity for the Operations Researcher," Operations Research, INFORMS, vol. 56(5), pages 1047-1065, October.
    11. Choong Kwai Fatt & Ephrance Abu Ujum & Kuru Ratnavelu, 2010. "The structure of collaboration in the Journal of Finance," Scientometrics, Springer;Akadémiai Kiadó, vol. 85(3), pages 849-860, December.
    12. Santiago, A. & Benito, R.M., 2009. "Robustness of heterogeneous complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(11), pages 2234-2242.
    13. Caroline A Johnson & Allison C Reilly & Roger Flage & Seth D Guikema, 2021. "Characterizing the robustness of power-law networks that experience spatially-correlated failures," Journal of Risk and Reliability, , vol. 235(3), pages 403-415, June.
    14. Liu, Yang & Wei, Bo & Du, Yuxian & Xiao, Fuyuan & Deng, Yong, 2016. "Identifying influential spreaders by weight degree centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 86(C), pages 1-7.
    15. Luo, Xiaojuan & Hu, Yuhen & Zhu, Yu, 2014. "Topology evolution model for wireless multi-hop network based on socially inspired mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 416(C), pages 639-650.
    16. Sanjeev Goyal & Fernando Vega-Redondo, 2000. "Learning, Network Formation and Coordination," Econometric Society World Congress 2000 Contributed Papers 0113, Econometric Society.
    17. Liang, Wei & Shi, Yuming & Huang, Qiuling, 2014. "Modeling the Chinese language as an evolving network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 268-276.
    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. Chen, Lei & Yue, Dong & Dou, Chunxia, 2019. "Optimization on vulnerability analysis and redundancy protection in interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1216-1226.
    20. Bálint Mészáros & István Simon & Zsuzsanna Dosztányi, 2009. "Prediction of Protein Binding Regions in Disordered Proteins," PLOS Computational Biology, Public Library of Science, vol. 5(5), pages 1-18, May.

    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:599:y:2022:i:c:s0378437122003168. 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.