This course deals with computer science (CS) aspects of social network analysis (SNA), and is open to all students in the master computer science programme at Leiden University.


Course information

Lectures: Fridays from 9:00 to 10:45 in Gorlaeus lecture room CM 1.26
Lab sessions: Fridays from 11:00 to 12:45 in Gorlaeus lab rooms DM0.09, DM0.13 and DM0.21
Prerequisites: a bachelor degree in CS with courses on Algorithms, Data Structures, and, Machine Learning or Data Mining
Literature: The Atlas for the Aspiring Network Scientist (by Michele Coscia, v3, 2025)
Examination: assignments throughout the semester and a final exam at the end of the semester
Brightspace link: 2627-S1 Social Network Analysis for Computer Scientists
Study guide link: Social Network Analysis for Computer Scientists
Study points: 6 ECTS

Course staff: prof. dr. Frank Takes (f.w.takes@liacs.leidenuniv.nl, BE 3.07), Rachel de Jong MSc (BE 3.03)
Assistants: Gamal Adel Elgamal MSc (BE 3.23), Nicholas Assiotis BSc, Agata Cieliczko BSc, Bart Holterman BSc, Rachel Hau BSc and Mark Wijnands BSc

Need help? Ask your questions during the lab sessions. If it is more urgent, drop by the lecturer or assistant's offices. If they are not around, contact snacs@liacs.leidenuniv.nl.


[Network visualization image]

Network with 1458 nodes and 1948 edges.

Course schedule

  Date Lecture (9:00-10:45) Lab session (11:00-12:45)
1. Fri Sep 4, 2026 Lecture 0: Course information (Chapter 1)
Lecture 1: Introduction to network analysis (Chapter 6, 8, 9 and 10)
Instruction: Introduction to Gephi
Work on Assignment 1
2. Fri Sep 11, 2026 Lecture 2: Small world phenomenon, advanced concepts and centrality
(Chapter 7, 12, 30 and 31)
Instruction: Introduction to NetworkX
Work on Assignment 1
... ... ... ...
Mon Oct 5, 2026 Deadline for Assignment 1 (14:00; hand in via Brightspace)
... ... ... ...
Mon Nov 9, 2026 Deadline for Assignment 2 (14:00; hand in via Brightspace)
... ... ... ...
Fri Dec 11, 2026 Exam (in USC)
Mon Dec 14, 2026 Deadline for Retake Assignment to replace failed assignment(s) (14:00; hand in via Brightspace on top of failed assignment)
Thu Dec 17, 2026 Exam result inspection opportunity (12:00 in teacher's office BE 3.07)
Jan 29, 2027 Retake Exam (in USC)

gephi

About social network analysis tools and packages. There exist different tools and packages for social network analysis. In this course, we cover two of them, with complementary advantages:

  1. Gephi, an easy-to-use tool with a graphical interface useful for visualization and quick analysis of relatively small network data (this week, see below).
  2. NetworkX, an extensive Python package for network analysis that can handle larger network datasets and computations (next week).

Learning goals. The main goal of this lab session is to become familiar with Gephi (experimental beta-software to visualize networks for research purposes) and its input format. At the end of this session you should be able to:

  • Know how to use Gephi for social network analysis
  • Import and visualize raw network data with labeled nodes and labeled and/or weighted edges (directed or undirected),
  • Understand how to map edge and node size and color to structural network properties such as the node degree and edge type,
  • Know how to apply filters to the visualization, for example to focus only on the giant component,
  • Export a vector graphic PDF of your network for reuse in for example a presentation or paper,
  • Export computed node data for reuse in another program.

There is no deliverable for this lab session, but you are assumed to know the tool afterwards. Practice more at home if needed.


Instructions for today: Walk through the complete Gephi tutorial.


Note that the tutorial briefly covers topics such as centrality and communities, which will not be covered extensively until Lecture 2, 3 and 4.

Done? Get started with the practical part of Assignment 1. You can download the datafiles here. If you want to analyze huge.tsv, you will have to get it from the shared folder in the ISSC Linux or LIACS DS lab environment, as stated in the assignment.


Reading material

In the past, students have expressed interest in additional reading material to help freshen up on skills and knowledge required for this course.


Past editions

The course was also given in 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025 (although in a different format)