|Professors||Nikitas-Marinos Sgouros Evangelos Haleplidis|
|Lecture hours||3 hours|
|Lab hours||2 hours|
|Digital resources||View on Aristarchus (Open e-Class)|
This course is the basic introductory course in the field of computational analysis and synthesis of social networks.
The course material seeks to introduce the students to the basic concepts and algorithms for the study of social networks. The course focuses on answering questions related to the creation of social networks, their information properties and the interaction between their structure and the emergence of social processes related to information diffusion, strategic interaction and collective behavior. All theoretical results are presented in relation to their application in real problems in social computational environments such as Facebook of Google search.
The successful completion of the course will make students capable of:
- understanding the basic and important features of social networks in both an algorithmic and interaction level.
- knowing the major features of the tools and development methods for the creation of digital social networks and applications
- Conceptual features of social networks
- Elements of Graph Theory
- Social links
- Topics in Social Environments (Homophily, Group participation, Separation)
- Social Balancing
- Information Diffusion
- Elements of Game Theory
- Group Decision-Making
- Sharing frameworks
- Martin J. Osborne, An Introduction to Game Theory, Oxford, 2010
- Instructor Notes