27-38

• Κύδρος, Δημήτρης
• Τρευλάκης, Νίκος

In this paper we provide some insights in the structure of the Greek Parliament from the perspective of social network analysis. We use historical and publicly available data to create a social network (i.e. a graph) that comprises of all members of the Greek Parliament for a period of 80 years, together with their interactions. We present a visualization of these data and calculate some well-established metrics, coming from social network analysis in this social network. Our results indicate that the Greek Parliament Network (GPN) is a small-world network, rather dissasortative and very difficult to disconnect. We finally argue that this network may be prone to produce corruption in its general sense.

• Political Science
• Media and communications

• Πολιτική επιστήμη
• Πολιτική και ηθική
• Political sociology
• Communication in politics
• Οικονομία

social network analysis, small worlds, politics, Greek parliament, assortativity coefficient, scale-free networks

Περιέχει πίνακες και σχήματα

1. Barabasi, A. L. (2002),Linked: The New Science ofNetworks, Perseus, Cambridge, MA Bojan Mohar, (1991), The Laplacian Spectrum of Graphs, Graph Theory, Combinatorics, and Applications, 2, Eds. Y. Alavi, G. Chartrand, O. R. Oellermann, A. J. Schwenk, Wiley, pp. 871-898 Borgatti,S.P., Everett, M.G. and Freeman, L.C. (2002). Ucinet for Windows: Software for Social Network Analysis, Harvard, MA: Analytic Technologies. Chung, F.R.K. (1997), Spectral graph theory, Conference Board of the Mathematical Sciences, 92, AMS, Providence, RI Csardi, G. Nepusz, T. (2006), The igraph software package for complex network research, InterJournal Complex Systems 1695, http ://igraph.sf.net Granovetter, M. (2007), The Social Construction of Corruption, in Victor Nee and Richard Swedberg, editors, On Capitalism, Stanford University Press, pp. 152-172 Gross, J.L and Yellen, J. (2004), Handbook of Graph Theory, CRC Press, page 571 Hagberg, A. Schult, and Swart, (2008), Exploring network structure, dynamics, and function using NetworkX, Proceedings of the 7th Python in Science Conference (SciPy2008), Gäel Varoquaux, Travis Vaugh and Jarrod Millman (Eds), (Pasadena, CA USA), pp. 11-15, Aug 2008 Hanneman, Robert A. and Riddle Μ. (2005), Introduction to social network methods, Riverside, CA: University of California, Riverside (published in digital form at http://faculty.ucr.edu/~hanneman/ , accessed December 2010) Harary Frank (1969), Graph Theory, Addison-Wesley, Reading, MA Jamakovic, A. Uhlig, S. and Theisler, I.B. (2007), On the relationships between topological metrics in real-world networks, Proc. of the 4th European Conference on Complex Systems (ECCS'07), Dresden, Germany Kooij, R. et. al. (2009), "The Dutch Soccer Team as a Social Network", Connections, 29, Issue 1 Newman, M.E.J. (2002a), "The structure and function of complex networks", SIAM Review, 45, pp. 167-256 Newman, M.E.J. (2002b), Assortative mixing in networks. Phys. Rev. Lett.89: 208701 Newman, M.E.J. (2005), "Power laws, Pareto distributions and Zipf's law", Contemporary Physics, 46, Issue 5 Pajek, (2007), Program for large network analysis, http://vlado.fmf.uni- 1j.si/pub/networks/pajek/ (accessed December 2009) Pfeffer, J. (2010), http://vlado.fmf.uni-lj.si/pub/networks/ pajek/howto/ excel2pajek.htm (accesed January 2012) Scott, J. (2000), Social Network Analysis. A Handbook, Sage Publications Wasserman, S. and Faust, K. (1994), Social Network Analysis: Methods and Applications, Cambridge University Press Watts, D.J. (1999), Small-Worlds: The Dynamics of Networks between Order and Randomness, Princeton University Press Watts, D.J. (2003), Six Degrees: The Science of a Connected Age, W.W. Norton & Company Watts, D.J. and Strogatz S.H. (1998), Collective dynamics of smallworld networks, Nature, 393, pp. 440-442.