The Degrees of Separation in Turkish Cinema: The Sühely Eğriboz Number

Year 2020, Volume: 7 Issue: 2, 1199 - 1212, 24.07.2020

Enes Abanoz

https://doi.org/10.17680/erciyesiletisim.708514

Abstract

We live in a small-world where a person can reach another person via -on average- six steps by knowing a friend of a friend and with digitalization. One of the important questions in small-world research is about which node being in the center of the small- world. In here, with the central node definition, we refer to the node that can connect to all other nodes in the small-world by the shortest paths. In this study, we analyze the connection among actors/actresses of the Turkish Cinema and aim to define the center node in it. We use a graph analysis method that creates an Actor-Movie bipartite graph and projects it into a one-mode Actor-Actor graph to find the center node in the Turkish Cinema. Our results show that actor Sühely Eğriboz is the center node of Turkish Cinema graph with the lowest closeness centrality and average actor number value. Although there are paths that are longer than six steps, Sühely Eğriboz can reach any given actor/ actress with an average 3.142 steps.

Keywords

Cinema, Network, Degree, Separation, Graph

Türk Sinemasında Ayrılma Dereceleri: Sühely Eğriboz Sayısı

Abstract

Bir bireyin bir başka bireye, dijitalleşme ve kişisel bağlantılar aracılığıyla (arkadaşımın arkadaşı) ortalama altı adımda ulaşabileceği küçük bir dünyada yaşıyoruz. Küçük dünya olgusunun ele alındığı araştırmalarda önemli bir soru da hangi düğümün (birey, nesne vb.), mevcut yapının merkezinde yer aldığıdır. Burada, merkez düğüm tanımıyla küçük dünya yapısı içinde yer alan tüm diğer düğümlere en kısa bağlantı yoluna sahip olan düğümü ifade ediyoruz. Bu çalışmada; Türk Sinemasında yer alan aktörler/aktrisler arasında var olan bağlantıların analiz edilmesiyle birlikte, merkez düğümün tanımlanması amaçlanmıştır. Türk Sinemasındaki merkez düğümü bulmak için; Aktör-Film iki taraflı çizgesini oluşturan ve bunu tek taraflı Aktör-Aktör çizgesine indirgeyen çizge analiz yöntemi kullanılmıştır. Çalışma sonuçları, Süheyl Eğriboz’un en düşük yakınlık merkeziliği ve ortalama aktör sayısı değerleri ile merkezi düğüm olduğunu ortaya koymuştur. Altı adımdan daha uzun yolların var olmasına rağmen, Sühely Eğriboz çizge içinde verilen herhangi bir aktöre/aktriste ortalama 3.142 adımda ulaşabilmektedir.

Keywords

Sinema, Ağ, Derece, Ayrım, Çizge

References

• Abraham, A., Hassanien, A. E., & Snášel, V. (Eds.). (2010). Computational Social Network Analysis: Trends, Tools and Research Advances. Dordrecht, Netherlands: Springer.
• Aylward, B. S., Odar, C. C., Kessler, E. D., Canter, K. S., & Roberts, M. C. (2012). Six Degrees of Separation: An Exploratory Network Analysis of Mentoring Relationships in Pediatric Psychology. Journal of Pediatric Psychology, 37(9), 972–979. https://doi. org/10.1093/jpepsy/jss078
• Barabási, A.-L. (2002). Linked: The New Science of Networks. Cambridge, MA: Perseus Publishing.
• Barabási, A.-L. (2016). Network Science (1st Edition). Cambridge, UK: Cambridge University Press.
• Barrat, A., Barthelemy, M., & Vespignani, A. (2008). Dynamical processes on complex networks. Cambridge: Cambridge University Press.
• Csardi, G., & Nepusz, T. (2006). The igraph software package for complex network research. InterJournal, Complex Systems, 1695.
• Easley, D., & Kleinberg, J. (2010). Networks, Crowds and Markets: Reasoning about a Highly Connected World (1st Edition). New York, NY: Cambridge University Press. gordonm888. (2015, September 19). 18 prolific actors who appeared in 120+ films [Online Database]. Retrieved February 5, 2019, from http://www.imdb.com/list/ ls053612898/
• Harary, F. (1969). Graph Theory. Boston, MA: Addison-Wesley Publishing Company.
• Hautz, W. E., Krummrey, G., Exadaktylos, A., & Hautz, S. C. (2016). Six degrees of separation: the small world of medical education. Medical Education, 50(12), 1274–1279. https://doi.org/10.1111/medu.13102
• Jackson, M. O. (2010). Social and Economic Networks. Princeton, NJ: Princeton University Press.
• Karinthy, F. (1929). Chains. In E. Jankó (Ed.), A. Makkai (Trans.), Everything is Different. Budapest.
• Kleinberg, J., & Tardos, É. (2006). Algorithm Design. Boston: Pearson/Addison-Wesley.
• Milgram, S. (1967). The Small-World Problem. Psychology Today, 1(1), 61–67.
• Newman, M. (2010). Networks: An Introduction. New York, NY: Oxford University Press Inc.
• Newman, M., Barabási, A.-L., & Watts, D. J. (2006). The Structure and Dynamics of Networks (1st Edition). Princeton, NJ: Princeton University Press.
• Pattison, P. (1993). Algebraic Models for Social Networks. New York, NY: Cambridge University Press.
• Python Dev Team. (2018). Python: A programing language. Beaverton, OR: Python Software Foundation. Retrieved from https://www.python.org
• R Core Team. (2017). R: A language and environment for statistical computing. Vienna, Austria: R Foundation for Statistical Computing. Retrieved from https://www.Rproject. org
• Travers, J., & Milgram, S. (1969). An Experimental Study of the Small World Problem. Sociometry, 32(4), 425–443.
• Wasserman, S., & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge, UK: Cambridge University Press.
• Watts, D. J. (2003). Six degrees: the science of a connected age (1st ed). New York, NY: Norton.
• West, D. B. (2000). Introduction to Graph Theory (2nd Edition). Upper Saddle River, NJ: Pearson.
• Wilson, R. J. (1996). Introduction to Graph Theory (4th Edition). Harlow, NJ: Prentice Hall.
• Zweig, K. A., & Kaufmann, M. (2011). A systematic approach to the one-mode projection of bipartite graphs. Social Network Analysis and Mining, 1(3), 187–218. https://doi. org/10.1007/s13278-011-0021-0