Abstract
Sometimes the world appears to be as big as we thought. How many times have you met someone for the first time, maybe in another city, and discovered that you have friends in common? Indeed the experience and experiments, such as those of the famous sociologist Milgram in the 1960s, show that in most cases short chains of acquaintances are enough to connect any two people on the planet. This phenomenon became known as the mystery of the “six degrees of separation”, and it is increasingly relevant due to the importance that natural and technological networks have taken today. The aim of this two-part article is to address the issue from mathematical and historical point of view, showing how the graphs are a good tool to analyse the problem. In this first part we begin with regular and random graphs.
Similar content being viewed by others
References
Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74, 47–97 (2002)
Cho, D.: E-mail study corroborates six degrees of separation, scientific American, 8 Aug 2003
Durrett, R.: Random graph dynamics. Cambridge University Press, Cambridge (2006)
Erdős, P., Rényi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl 5 (1960)
Karinthy, F.: Chain-links (Láncszemek, translated by Adam Makkai). In: Newman, M., Barabási, A.-L., Watts, D.J. (eds.) The structure and dynamics of networks. Princeton University Press, Princeton (2006)
Leonesi, S., Toffalori, C.: Un invito all’algebra. Springer, Milan (2006)
Lovgren, S.: Six degrees of E-mail separate wired world? National geographic news, 7 Aug 2003
Milgram, S.: The small world problem. Psychol. Today 1(1), 61–67 (1967)
Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Leonesi, S. The mystery of the six degrees of separation, part I: from order to random. Lett Mat Int 3, 121–127 (2015). https://doi.org/10.1007/s40329-015-0088-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40329-015-0088-y