Inclusivity enhances robustness and efficiency of social networks

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.

[1]  Pedro J. Zufiria,et al.  Generating scale-free networks with adjustable clustering coefficient via random walks , 2011, 2011 IEEE Network Science Workshop.

[2]  Chris Hankin,et al.  Fast Multi-Scale Detection of Relevant Communities in Large-Scale Networks , 2013, Comput. J..

[3]  Béla Bollobás,et al.  Random Graphs , 1985 .

[4]  Michele Bellingeri,et al.  Robustness of weighted networks , 2018 .

[5]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[6]  Jurgen Kurths,et al.  Synchronization in complex networks , 2008, 0805.2976.

[7]  Albert-Lszl Barabsi,et al.  Network Science , 2016, Encyclopedia of Big Data.

[8]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[9]  Laura E. Buffardi,et al.  "What about me?" Perceptions of exclusion and whites' reactions to multiculturalism. , 2011, Journal of personality and social psychology.

[10]  T. Killingback,et al.  Attack Robustness and Centrality of Complex Networks , 2013, PloS one.

[11]  Linyuan Lu,et al.  Characterizing cycle structure in complex networks , 2020, Communications Physics.

[12]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks: Volume 1 , 2016 .

[13]  L. Amaral,et al.  Small-World Networks: Evidence for a Crossover Picture , 1999, cond-mat/9903108.

[14]  Catherine McLoughlin,et al.  Inclusivity and alignment: Principles of pedagogy, task and assessment design for effective cross‐cultural online learning , 2001 .

[15]  Zhe-Ming Lu,et al.  Efficacy of local attack strategies on the Beijing road complex weighted network , 2018, Physica A: Statistical Mechanics and its Applications.

[16]  L. Asz Random Walks on Graphs: a Survey , 2022 .

[17]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[18]  K. Ashcraft,et al.  Professionalization as a brand activity: occupational identity and the dialectic of inclusivity-exclusivity , 2012 .

[19]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[20]  S. N. Dorogovtsev,et al.  Generic scale of the"scale-free"growing networks , 2000 .

[21]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  M. Small,et al.  Emergence of scaling and assortative mixing through altruism , 2011 .

[23]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[24]  Santo Fortunato,et al.  Triadic closure as a basic generating mechanism of the structure of complex networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[26]  S. N. Dorogovtsev,et al.  Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model , 2000, cond-mat/0004434.

[27]  K. Kaski,et al.  Scale-free networks generated by random walkers , 2004, cond-mat/0404088.

[28]  P L Krapivsky,et al.  Weight-driven growing networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Francesco Scotognella,et al.  Link and Node Removal in Real Social Networks: A Review , 2020, Frontiers in Physics.

[31]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[32]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[33]  P. Gurin,et al.  The Benefits of Diversity in Education for Democratic Citizenship , 2004 .

[34]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[35]  Dianne Chambers,et al.  Inclusivity Imperatives and the Australian National Curriculum , 2010 .

[36]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[37]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[38]  Mark S. Granovetter The Strength of Weak Ties , 1973, American Journal of Sociology.

[39]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[40]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[41]  Michele Bellingeri,et al.  Efficiency of attack strategies on complex model and real-world networks , 2013, ArXiv.

[42]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .