University of L'Aquila
(Click here) to get News|
Department of Information Engineering Computer Science and Mathematics
Academic Year 2017/2018
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 lectures of Social Networks course will start (approximately) at the end of October 2017.
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.
First semester (November 2, 2017 - December 21, 2017), Wednesday: 9.30–11.30 (room A1.2) and Thursday: 11.30–13.30 (room A1.2)
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 2, 2017: Presentation of the course. Slides (Click here)
Chapter 2 of the textbook: Graphs. Whole chapter.
November 15, 2017: 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; 3.4 Tie Strength, Social Media, and Passive Engagement.
November 16, 2017: Chapter 3 of the textbook: 3.5 Closure, Structural Holes, and Social Capital;
3.6 Advanced Material: Betweenness Measures and Graph Partitioning.
November 22, 2017: 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 23, 2017: 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 29, 2017: Exercises of chapters 2,3,4,5, past exams exercises solutions: exercises solutions have been proposed on the blackboard.
November 30, 2017: 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.
December 6, 2017: Mid-term examination.
December 7, 2017: Mid-term exam exercises solutions (exercises solutions have been proposed on the blackboard).
Chapter 12 of the textbook: 12.8 Modeling Network Exchange: Balanced Outcomes.
Exam exercises about topics of chapter 12: Exercises solutions have been proposed on the blackboard.
December 13, 2017: 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 14, 2017: 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 (first part): Exercises solutions have been proposed on the blackboard.
December 20, 2017: Exercises of chapters 19 (last part): Exercises solutions have been proposed on the blackboard.
November 23, 2017: The Mid-term exam date is Wednesday December 6, 9.30-11.30, room A1.2 .
The mid-term exam covers arguments from chapter 1 to chapter 5 (included) of the textbook.
November 28, 2017: Click here to download the assignment of the exams assignments of a.y. 2016-2017.
December 6, 2017: Available the results of the Mid-term exam of December 6, 2017.
December 12, 2017: Final exams (for both students having "Social Networks" (3 CFU) and students
having "Autonomous Networks" (6 CFU) in their personal study plan) semester #1 A.Y. 2017/2018: (Period January 8, 2018 - February 23, 2018)
1° Monday January 15, 2018. Time: 14.30
2° Monday January 29, 2018. Time: 14.30
3° Monday February 12, 2018. Time: 14.30
For students having "Autonomous Networks" (6 CFU) in their personal study plan:
they have to sustain the exam relative to the part of "Non Cooperative Networks" (3 CFU) with Prof. Proietti.
December 20, 2017: There will be no lecture Thursday December 21.
January 20, 2018: Click here to download the assignment of the examination of January 15, 2018.