University of L'Aquila
(Click here) to get News|
Department of Information Engineering Computer Science and Mathematics
Academic Year 2018/2019
Autonomous Networks: 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 networks sheds light on these connections.
Particular topics include: how opinions, fads, and political movements spread through society, the theory behind strong and weak ties in relationships,
and the small-world phenomenon. Students will learn to use models and theory to explain and exploit the structure of information and social networks.
Additional topics will be covered as time permits.
The (tentative) schedule of the course is the following (with respect to the chapters of the textbook):
Ch. 1 of the textbook: overview;
Ch. 2 of the textbook: Graphs;
Ch. 3 of the textbook: Strong and Weak Ties;
Ch. 4 of the textbook: Networks in their Surrounding Contexts;
Ch. 5 of the textbook: Positive and Negative Relationships;
Part of Ch. 12 of the textbook: Bargaining and Power in Networks;
Ch. 18 of the textbook: Power Laws and Rich-Get-Richer Phenomena;
Ch. 19 of the textbook: Cascading Behavior in Networks;
Ch. 20 of the textbook: The Small-World Phenomenon.
After the lectures or by appointment. Given that I could be out of the office due to academic or research commitments,
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.
November 14, 2018: Presentation of the course. Slides (Click here)
Chapter 2 of the textbook: Graphs. Whole chapter. Chapter 3 of the textbook: Strong and Weak Ties. 3.1 Triadic Closure.
November 15, 2018: Chapter 3 of the textbook: 3.2 The Strength of Weak Ties; 3.3 Tie Strength and Network Structure in Large-Scale Data; 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.
November 21, 2018: 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.
November 22, 2018: Chapter 5 of the textbook: Positive and Negative Relationships. 5.1 Structural Balance; 5.2 Characterizing the Structure of Balanced Networks;
5.3 Applications of Structural Balance; 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.
November 28, 2018: Chapter 12 of the textbook: Bargaining and Power in Networks. 12.1 Power in Social Networks; 12.2 Experimental Studies of Power and Exchange;
12.3 Results of Network Exchange Experiments; 12.5 Modeling Two-Person Interaction: The Nash Bargaining Solution; 12.6 Modeling Two-Person Interaction: The Ultimatum Game;
12.7 Modeling Network Exchange: Stable Outcomes; 12.8 Modeling Network Exchange: Balanced Outcomes.
November 29, 2018: Exercises: past exam assignments and exercises from the textbook. The solutions have been proposed on the blackboard.
December 5, 2018: Chapter 19 of the textbook: Cascading Behavior in Networks. 19.1 Diffusion in Networks; 19.2 Modeling Diffusion through a Network;
19.3 Cascades and Clusters; 19.4 Diffusion, Thresholds, and the Role of Weak Ties; 19.5 Extensions of the Basic Cascade Model: Heterogeneous Thresholds.
December 6, 2018: Chapter 19 of the textbook: Cascading Behavior in Networks. 19.6 Knowledge, Thresholds, and Collective Action;
19.7 Advanced Material: The Cascade Capacity A:Cascades on Infinite Networks; B:How Large Can the Cascade Capacity Be?
Exercises of chapters 19: Exercises solutions have been proposed on the blackboard.
December 12, 2018: Mid-term examination.
December 13, 2018: Additively separable hedonic games. Slides (Click here)
December 19, 2018: Fractional hedonic games. Slides (Click here) (Notice that the slides contain also the argument of the tomorrow's class).
December 20, 2018: Fractional hedonic games (last part). There was a typo in the slide 29. (Click here) to download the updated version of slide 29.
November 29, 2018: Click here to download some of the past exam assignments.
November 29, 2018: The Mid-term exam date is Wednesday December 12, 9.30-11.30, room A1.2.
The mid-term exam covers arguments from chapter 1 to chapter 5 (included), and chapther 12 of the textbook.
December 7, 2018: Final exams semester #1 A.Y. 2018/2019: (Period January 7, 2019 - February 22, 2019)
1° Monday January 14, 2019. Time: 14.30
2° Monday January 28, 2019. Time: 14.30
3° Monday February 11, 2019. Time: 14.30
December 14, 2018: Available the results of the Mid-term exam of December 12, 2018.
Janaury 8, 2019: There was not a typo in the slide 29 of the lecture about Fractional hedonic games. The correct slides about Fractional hedonic games are thus the ones published on December 19, 2018, i.e., do not consider the updated version slide published on December 20, 2018. (Thanks to Davide Iacobelli for noticing that).
January 15, 2019: Available the results of the examination of January 14, 2019.
(Click here). Exams recording and oral exams: Thursday January 17, Time: 10:00 a.m.
January 21, 2019: Click here to download the assignment of the examination of January 14, 2019.
January 29, 2019: Available the results of the examination of January 28, 2019.
(Click here). Exams recording and oral exams: Thursday January 31, Time: 10:00 a.m.
February 12, 2019: Available the results of the examination of February 11, 2019.
(Click here). Exams recording and oral exams: Wednesday February 13, Time: 10:00 a.m.