- Open Access
Why Are There Six Degrees of Separation in a Social Network?
Phys. Rev. X 13, 021032 – Published 31 May, 2023
DOI: https://doi.org/10.1103/PhysRevX.13.021032
Abstract
A wealth of evidence shows that real-world networks are endowed with the small-world property, i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most social networks are organized so that no individual is more than six connections apart from any other, an empirical regularity known as the six degrees of separation. Why social networks have this ultrasmall-world organization, whereby the graph’s diameter is independent of the network size over several orders of magnitude, is still unknown. We show that the “six degrees of separation” is the property featured by the equilibrium state of any network where individuals weigh between their aspiration to improve their centrality and the costs incurred in forming and maintaining connections. We show, moreover, that the emergence of such a regularity is compatible with all other features, such as clustering and scale-freeness, that normally characterize the structure of social networks. Thus, our results show how simple evolutionary rules of the kind traditionally associated with human cooperation and altruism can also account for the emergence of one of the most intriguing attributes of social networks.
Physics Subject Headings (PhySH)
Popular Summary
One of the most intriguing and captivating features of social networks is that they are organized so that no individual is more than six connections apart from any other, an empirical regularity known as the six degrees of separation. Why social networks have this ultrasmall world organization—where the diameter of a graph of the network is independent of the network size over several orders of magnitude—is still unknown. Our study shows that this property is the direct consequence of the dynamical evolution of any network structure where individuals weigh their aspiration to improve their centrality against the costs incurred in forming or maintaining connections.
We look at the evolution of a graph whose growth is governed by a simple compensation rule. This rule balances the cost incurred by nodes in maintaining connections and the benefit accrued by the chosen links. In this case, the graph’s asymptotic equilibrium state (a Nash equilibrium, where no further actions would produce more benefit than cost) features a diameter that, irrespective of the network’s initial connectivity structure, does not depend on the system’s size and is equal to six.
Our study points out that evolutionary rules of the kind traditionally associated with human cooperation and altruism can in fact account also for the emergence of the six degrees of separation in social networks.
Article Text
Supplemental Material
References (68)
- D. J. Watts and S. H. Strogatz, Collective Dynamics of ‘Small-World’ Networks, Nature (London) 393, 440 (1998).
- M. Gurevitch, The social structure of acquaintanceship networks, Ph.D. thesis, Massachusetts Institute of Technology, 1961.
- I. de Sola Pool and M. Kochen, Contacts and Influence, Soc. Networks 1, 5 (1978).
- S. Milgram, The Small World Problem, Psychol. Today 2, 60 (1967), http://snap.stanford.edu/class/cs224w-readings/milgram67smallworld.pdf.
- J. Travers and S. Milgram, An Experimental Study of the Small World Problem in Social Networks (Elsevier, New York, 1977), pp. 179–197.
- P. S. Dodds, R. Muhamad, and D. J. Watts, An Experimental Study of Search in Global Social Networks, Science 301, 827 (2003).
- J. Leskovec and E. Horvitz, Planetary-Scale Views on a Large Instant-Messaging Network, in Proceedings of the 17th international conference on World Wide Web (2008), pp. 915–924.
- K. Sanderson, Six degrees of messaging, Nature (London) (2008), 10.1038/news.2008.670.
- R. Bakhshandeh, M. Samadi, Z. Azimifar, and J. Schaeffer, Degrees of Separation in Social Networks, in Proceedings of the International Symposium on Combinatorial Search (AAAI Press, 2011), Vol. 2, 10.1609/socs.v2i1.18200.
- L. Backstrom, P. Boldi, M. Rosa, J. Ugander, and S. Vigna, Four Degrees of Separation, in Proceedings of the 4th Annual ACM Web Science Conference (Association for Computing Machinery, New York, NY, 2012), pp. 33–42.
- R. B. Myerson, Graphs and Cooperation in Games, Math. Oper. Res. 2, 225 (1977).
- M. O. Jackson and A. Wolinsky, A Strategic Model of Social and Economic Networks, J. Econ. Theory 71, 44 (1996).
- M. A. Nowak and R. M. May, Evolutionary Games and Spatial Chaos, Nature (London) 359, 826 (1992).
- H. Ebel and S. Bornholdt, Coevolutionary Games on Networks, Phys. Rev. E 66, 056118 (2002).
- M. G. Zimmermann, V. Eguíluz, and M. San Miguel, Coevolution of Dynamical States and Interactions in Dynamic Networks, Phys. Rev. E 69, 065102(R) (2004).
- M. G. Zimmermann and V. Eguíluz, Cooperation, Social Networks and the Emergence of Leadership in a Prisoner’s Dilemma with Local Interactions, Phys. Rev. E 72, 056118 (2005).
- J. M. Pacheco, A. Traulsen, and M. A. Nowak, Coevolution of Strategy and Structure in Complex Networks with Dynamical Linking, Phys. Rev. Lett. 97, 258103 (2006).
- J. Gómez-Gardeñes, M. Campillo, Y. Moreno, and L. M. Floría, Dynamical Organization of Cooperation in Complex Networks, Phys. Rev. Lett. 98, 108103 (2007).
- T. Gross and B. Blasius, Adaptive Coevolutionary Networks: A Review, J. R. Soc. Interface 5, 259 (2008).
- H, Ohtsuki, C. Hauert, E. Lieberman, and M. A. Nowak, A Simple Rule for the Evolution of Cooperation on Graphs and Social Networks, Nature (London) 441, 502 (2006).
- S. Goyal and F. Vega-Redondo, Network Formation and Social Coordination, Games Econ. Behavior 50, 178 (2005).
- F. Bloch and M. O. Jackson, The Formation of Networks with Transfers among Players, J. Econ. Theory 133, 83 (2007).
- J. Poncela, J. Gómez-Gardeñes, A. Traulsen, and Y. Moreno, Evolutionary Game Dynamics in a Growing Structured Population, New J. Phys. 11, 083031 (2009).
- X. Bei, W. Chen, S.-H. Teng, J. Zhang, and J. Zhu, Bounded Budget Betweenness Centrality Game for Strategic Network Formations, Theor. Comput. Sci. 412, 7147 (2011).
- P. Holme and G. Ghostal, Dynamics of Networking Agents Competing for High Centrality and Low Degree, Phys. Rev. Lett. 96, 098701 (2006).
- R. Cohen and S. Havlin, Scale-Free Networks Are Ultrasmall, Phys. Rev. Lett. 90, 058701 (2003).
- C. I. N. Sampaio Filho, A. A. Moreira, R. F. S. Andrade, H. J. Herrmann, and J. S. Andrade, Mandala Networks: Ultra-Small-World and Highly Sparse Graphs, Sci. Rep. 5, 1 (2015).
- J. F. Nash, Equilibrium Points in -Person Games, Proc. Natl. Acad. Sci. U.S.A. 36, 48 (1950).
- M. A. Nowak, Five Rules for the Evolution of Cooperation, Science 314, 1560 (2006).
- D. G. Rand, S. Arbesman, and N. A. Christakis, Dynamic Social Networks Promote Cooperation in Experiments with Humans, Proc. Natl. Acad. Sci,. U.S.A. 108, 19193 (2011).
- D. G. Rand and M. A. Nowak, Human Cooperation, Trends Cognit. Sci. 17, 413 (2013).
- F. Fu, C. E. Tarnita, N. A. Christakis, L. Wang, D. G. Rand, and M. A. Nowak, Evolution of In-Group Favoritism, Nat. Sci. Rep. Ochanomizu Univ. 2, 460 (2012).
- F. Fu, M. A. Nowak, N. A. Christakis, and J. H. Fowler, The Evolution of Homophily, Nat. Sci. Rep. Ochanomizu Univ. 2, 845 (2012).
- L. C. Freeman, A Set of Measures of Centrality Based on Betweenness, Sociometry 40, 35 (1977).
- J. F. Fink and M. S. Jacobson, On -Domination, -Dependence and Forbidden Subgraphs, Graph Theory with Applications to Algorithms and Computer Science (John Wiley & Sons, Inc.USA, 1985), pp. 301–311, 10.5555/21936.25447.
- See Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevX.13.021032 for all details of the theorematic proofs which are referred to in the main text.
- A. L. Barabási and R. Albert, Emergence of Scaling in Random Networks, Science 286, 509 (1999).
- B. Bollobás and O. M. Riordan, Mathematical Results on Scale-Free Random Graphs, Handbook of Graphs and Networks: From the Genome to the Internet (John Wiley & Sons, Ltd., 2003), pp. 1–34, 10.1002/3527602755.ch1.
- A. Flaxman, A. Frieze, and T Fenner, High Degree Vertices and Eigenvalues in the Preferential Attachment Graph, Internet Math. 2, 1 (2005).
- M. E. Newman, Scientific Collaboration Networks. II. Shortest Paths, Weighted Networks, and Centrality, Phys. Rev. E 64, 016132 (2001).
- U. Brandes, A Faster Algorithm for Betweenness Centrality, J. Math. Sociol. 25, 163 (2001).
- E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A. L. Barabási, Hierarchical Organization of Modularity in Metabolic Networks, Science 297, 1551 (2002).
- S. Boccaletti, D.-U. Hwang, and V. Latora, Growing Hierarchical Scale-Free Networks by Means of Nonhierarchical Processes, Int. J. Bifurcation Chaos Appl. Sci. Eng. 17, 2447 (2007).
- V. M. Eguíluz, M. G. Zimmermann, C. J. Cela-Conde, and M. S. Miguel, Cooperation and the Emergence of Role Differentiation in the Dynamics of Social Networks, Am. J. Sociol. 110, 977 (2005).
- M. Perc and A. Szolnoki, Coevolutionary Games—A Mini Review, BioSystems 99, 109 (2010).
- M. O. Jackson, Social and Economic Networks (Princeton University Press, Princeton, NJ, 2010).
- N. A. Christakis and J. H. Fowler, Social Contagion Theory: Examining Dynamic Social Networks and Human Behavior, Stat. Med. 32, 556 (2013).
- A. Nishi, H, Shirado, D. G. Rand, and N. A. Christakis, Inequality and Visibility of Wealth in Experimental Social Networks, Nature (London) 526, 426 (2015).
- U. Alvarez-Rodriguez, F. Battiston, G. F. de Arruda, Y. Moreno, M. Perc, and V. Latora, Evolutionary Dynamics of Higher-Order Interactions in Social Networks, Nat. Hum. Behav. 5, 586 (2021).
- P. Holme and J. Saramäki, Temporal Networks, Phys. Rep. 519, 97 (2012).
- R. Guimera, S. Mossa, A. Turtschi, and L. N. Amaral, The Worldwide Air Transportation Network: Anomalous Centrality, Community Structure, and Cities’ Global Roles, Proc. Natl. Acad. Sci. U.S.A. 102, 7794 (2005).
- H. Barbosa, M. Barthelemy, G. Ghoshal, C. R. James, M. Lenormand, T. Louail, R. Menezes, J. J. Ramasco, F. Simini, and M. Tomasini, Human Mobility: Models and Applications, Phys. Rep. 734, 1 (2018).
- W. Lei, L. G. Alves, and L. A. N. Amaral, Forecasting the Evolution of Fast-Changing Transportation Networks Using Machine Learning, Nat. Commun. 13, 1 (2022).
- H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A. L. Barabási, The Large-Scale Organization of Metabolic Networks, Nature (London) 407, 651 (2000).
- D. S. Bassett and O. Sporns, Network Neuroscience, Nat. Neurosci. 20, 353 (2017).
- I. Zwir, C. Del-Val, M. Hintsanen, K. M. Cloninger, R. Romero-Zaliz, A. Mesa, J. Arnedo, R. Salas, G. F. Poblete, E. Raitoharju, O. Raitakari, L. Keltikangas-Järvinen, G. A. de Erausquin, I. Tattersall, T. Lehtimäki, and C. R. Cloninger, Evolution of Genetic Networks for Human Creativity, Mol. Psychiatry 27, 354 (2022).
- E. A. Tripp, F. Fu, and S. D. Pauls, Evolutionary Kuramoto Dynamics, Proc. R. Soc. B 289, 20220999 (2022).
- R. Albert, H. Jeong, and A. L. Barabási, Error and Attack Tolerance of Complex Networks, Nature (London) 406, 378 (2000).
- R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin, Resilience of the Internet to Random Breakdowns, Phys. Rev. Lett. 85, 4626 (2000).
- F. Morone and H. A. Makse, Influence Maximization in Complex Networks through Percolation, Nature (London) 524, 65 (2015).
- S. Ramón y Cajal, Histologie du Systéme Nerveux de l’Homme et des Vertébrés (1909); S. Ramón y CajalEnglish translation as Histology of the Nervous System of Man and Vertebrates, translated by N. Swanson and L. Swanson (Oxford University Press, New York, 1995).
- E. Bullmore and O. Sporns, The Economy of Brain Network Organization, Nat. Rev. Neurosci. 13, 336 (2012).
- P. Sterling and S. Laughlin, Principles of Neural Design (MIT Press, Cambridge, MA, 2015).
- M. S. Granovetter, The Strength of Weak Ties, Am. J. Sociol. 78, 1360 (1973).
- M. S. Granovetter, Getting a Job: A Study of Contacts and Careers (University of Chicago Press, Chicago, 2018).
- D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Cambridge University Press, Cambridge, England, 2010).
- R. S. Burt, Structural Holes: The Social Structure of Competition (Harvard University Press, Cambridge, MA, 1992).
- R. S. Burt, Structural Holes and Good Ideas, Am. J. Sociol. 110, 349 (2004).
