University of L'Aquila
(Click here) to get News|
Department of Information Engineering Computer Science and Mathematics
Academic Year 2021/2022
Social Networks (3 CREDITS).
Link to the Computer Science Degree official website (click here).
The course Autonomous Networks (6 CFU) is divided into: Non Cooperative Networks (3 CFU. By Prof. Proietti) and Social Networks (3 CFU).
The course investigates how the social, technological, and natural worlds are connected, and how the study of graphs and game theory sheds light on these connections. On successful completion of this module, the student will learn to use graphs and game theory to explain and analyze the structure of social networks.
Topics of the module include:
- Strong and weak ties in social networks;
- Surrounding contexts in social networks;
- Positive and negative relationships in social networks;
- Bargaining and power in social networks;
- Cascading behavior in social networks;
- Hedonic games: additively separable hedonic games and fractional hedonic games.
First semester (September 27, 2021 - January 14, 2022), Friday: 14.30 - 16.30 (room A1.5).
Name of the Team: Social Networks - A.A. 2021/2022.
Team code: 9mambgz
Online by appointment on the Team called: Gianpiero Monaco - Ricevimento Studenti (Students' Reception).
Students are invited to arrange the day and time of the meeting by e-mail and therefore to send an e-mail preventively.
David Easley, Jon Kleinberg: "Networks Crowds and Market: Reasoning about a highly Connected World". Cambridge Press, 2010.
A free (complete pre-publication) version of the textbook can be downloaded at this link.
October 1, 2021: Presentation of the course. Slides (Click here)
Chapter 2 of the textbook: Graphs. Whole chapter. Slides (Click here)
Chapter 3 of the textbook: Strong and Weak Ties: 3.1 Triadic Closure, 3.2 The Strength of Weak Ties; 3.3 Tie Strength and Network Structure in Large-Scale Data. Slides (Click here)
October 8, 2021: Chapter 3 of the textbook: 3.4 Tie Strength, Social Media, and Passive Engagement; 3.5 Closure, Structural Holes, and Social Capital. 3.6 Advanced Material: Betweenness Measures and Graph Partitioning. Slides (Click here)
October 15, 2021: Chapter 4 of the textbook: Networks in Their Surrounding. 4.1 Homophily; 4.2 Mechanisms Underlying Homophily: Selection and Social Influence; 4.3 Affiliation; 4.5 A Spatial Model of Segregation. Slides (Click here)
October 22, 2021: Chapter 5 of the textbook: Positive and Negative Relationships. 5.1 Structural Balance; 5.2 Characterizing the Structure of Balanced Networks; 5.4 A Weaker Form of Structural Balance; 5.5 Advanced Material: Generalizing the Definition of Structural Balance: Part A. Structural Balance in Arbitrary (Non-Complete) Networks. Slides (Click here)