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

Inclusivity enhances robustness and efficiency of social networks

Author

Listed:
  • Moore, Jack Murdoch
  • Small, Michael
  • Yan, Gang

Abstract

Many modern institutions seek to be inclusive, but the quantitative benefits of this goal are not always communicated effectively to stakeholders. To facilitate this important dialogue, we propose a simple model with which to grow, in the presence of a given level of inclusivity, networks which represent the structure of organisations. The model proceeds via an unweighted random walk in which inclusivity r is the maximum allowable separation between a new contact and the set of established contacts, which thus represents the maximum tolerable amount of novelty or “otherness”. The model can capture realistic small world and scale-free properties. In addition, the model fixes the limiting degree distribution, and particular parameter choices and initial conditions also fix clustering coefficient, and so allows the role of inclusivity to be isolated from these confounding factors. By considering this model, and also by randomly rewiring real networks in either an inclusive or an exclusive way, we show that, in comparison to exclusivity, inclusivity promotes unity (by decreasing modularity), efficiency and robustness. Increasing the ratio of the number of links to the number of nodes also enhances these qualities, as well as reducing their dependence upon inclusivity.

Suggested Citation

  • Moore, Jack Murdoch & Small, Michael & Yan, Gang, 2021. "Inclusivity enhances robustness and efficiency of social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    • Handle: RePEc:eee:phsmap:v:563:y:2021:i:c:s0378437120307895
    DOI: 10.1016/j.physa.2020.125490
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437120307895
    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.2020.125490?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. Li, Ping & Zhang, Jie & Small, Michael, 2011. "Emergence of scaling and assortative mixing through altruism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(11), pages 2192-2197.
    2. 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.
    3. Bellingeri, Michele & Cassi, Davide, 2018. "Robustness of weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 489(C), pages 47-55.
    4. Saramäki, Jari & Kaski, Kimmo, 2004. "Scale-free networks generated by random walkers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 341(C), pages 80-86.
    5. Bellingeri, M. & Bevacqua, D. & Scotognella, F. & LU, Zhe-Ming & Cassi, D., 2018. "Efficacy of local attack strategies on the Beijing road complex weighted network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 316-328.
    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. Wu, Yipeng & Chen, Zhilong & Zhao, Xudong & Liu, Ying & Zhang, Ping & Liu, Yajiao, 2021. "Robust analysis of cascading failures in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(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. Jisha Mariyam John & Michele Bellingeri & Divya Sindhu Lekha & Davide Cassi & Roberto Alfieri, 2024. "Robustness of Real-World Networks after Weight Thresholding with Strong Link Removal," Mathematics, MDPI, vol. 12(10), pages 1-16, May.
    2. Nie, Tingyuan & Fan, Bo & Wang, Zhenhao, 2022. "Complexity and robustness of weighted circuit network of placement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    3. P.B., Divya & Lekha, Divya Sindhu & Johnson, T.P. & Balakrishnan, Kannan, 2022. "Vulnerability of link-weighted complex networks in central attacks and fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    4. Yang, Yu & He, Ze & Song, Zouying & Fu, Xin & Wang, Jianwei, 2018. "Investigation on structural and spatial characteristics of taxi trip trajectory network in Xi’an, China," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 755-766.
    5. Lekha, Divya Sindhu & Balakrishnan, Kannan, 2020. "Central attacks in complex networks: A revisit with new fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 549(C).
    6. Bellingeri, M. & Bevacqua, D. & Scotognella, F. & LU, Zhe-Ming & Cassi, D., 2018. "Efficacy of local attack strategies on the Beijing road complex weighted network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 316-328.
    7. 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).
    8. Zhao, Peixin & Yin, Shengnan & Han, Xue & Li, Zhuyue, 2021. "Research on lean supply chain network model based on node removal," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 567(C).
    9. Jisha Mariyam John & Michele Bellingeri & Divya Sindhu Lekha & Davide Cassi & Roberto Alfieri, 2023. "Effect of Weight Thresholding on the Robustness of Real-World Complex Networks to Central Node Attacks," Mathematics, MDPI, vol. 11(16), pages 1-12, August.
    10. Mohd-Zaid, Fairul & Kabban, Christine M. Schubert & Deckro, Richard F. & White, Edward D., 2017. "Parameter specification for the degree distribution of simulated Barabási–Albert graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 141-152.
    11. Jichao Li & Yuejin Tan & Kewei Yang & Xiaoke Zhang & Bingfeng Ge, 2017. "Structural robustness of combat networks of weapon system-of-systems based on the operation loop," International Journal of Systems Science, Taylor & Francis Journals, vol. 48(3), pages 659-674, February.
    12. Yan Chen & Youran Qi & Qing Liu & Peter Chien, 2018. "Sequential sampling enhanced composite likelihood approach to estimation of social intercorrelations in large-scale networks," Quantitative Marketing and Economics (QME), Springer, vol. 16(4), pages 409-440, December.
    13. Xia, Ling-Ling & Song, Yu-Rong & Li, Chan-Chan & Jiang, Guo-Ping, 2018. "Improved targeted immunization strategies based on two rounds of selection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 540-547.
    14. Zhang, Lan & Huang, Changwei, 2023. "Preferential selection to promote cooperation on degree–degree correlation networks in spatial snowdrift games," Applied Mathematics and Computation, Elsevier, vol. 454(C).
    15. Sinan Aral & Paramveer S. Dhillon, 2023. "What (Exactly) Is Novelty in Networks? Unpacking the Vision Advantages of Brokers, Bridges, and Weak Ties," Management Science, INFORMS, vol. 69(2), pages 1092-1115, February.
    16. Hu, Xiaohua & Niu, Min, 2023. "Horizontal visibility graphs mapped from multifractal trinomial measures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    17. Yin, Kai & Wu, Jianjun & Wang, Weiping & Lee, Der-Horng & Wei, Yun, 2023. "An integrated resilience assessment model of urban transportation network: A case study of 40 cities in China," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    18. Zhang, Linjun & Small, Michael & Judd, Kevin, 2015. "Exactly scale-free scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 433(C), pages 182-197.
    19. Shriram Ashok Kumar & Maliha Tasnim & Zohvin Singh Basnyat & Faezeh Karimi & Kaveh Khalilpour, 2022. "Resilience Analysis of Australian Electricity and Gas Transmission Networks," Sustainability, MDPI, vol. 14(6), pages 1-20, March.
    20. S. R. Goldberg & H. Anthony & T. S. Evans, 2015. "Modelling citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 105(3), pages 1577-1604, December.

    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:563:y:2021:i:c:s0378437120307895. 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.