Social Network Analysis Course @ IIIT Delhi

Course Overview

This is an introductory course on Social Network Analysis (SNA) that is offered to undergraduate and graduate students. The contents are designed to cover both theoretical and practical aspects of several well-established graph algorithms. The assignments will contain theory and programming questions that help strengthen the theoretical foundations to work on simulated and publicly available real datasets. The project(s) will require students to develop a complete end-to-end solution requiring preprocessing, design of the graph algorithms, training and validation, testing and evaluation with quantitative performance comparisons.



Dr. Tanmoy Chakraborty
Assistant Professor and Ramanujan Fellow
Dept. of Computer Science & Engineering
IIIT Delhi, India
Project Director, Technology Innovative Hub (TIH), IIIT-Delhi

Teaching Assistant

Class Schedule

  • Tuesday, 1:30 - 3:00 PM
    Friday, 10:00 - 11:30 AM


  • Lecture Topics Material
    1 Course Logistics
    Ch1: What is Social Network Analysis (SNA)?
    Ch1: Why should we study SNA?
    Ch1: Preliminaries of SNA
    [ video ]
    2 Ch1: Levels of SNA
    Ch2: Network Basics
    Ch2: Node Centrality
    [ video ]
    3 Ch2: Node Centrality
    Ch2: Assortativity
    Ch2: Transitivity
    Ch2: Reciprocity
    Ch2: Similarity
    Ch2: Degeneracy
    [ video ]
    4 Ch3: Properties of a Network
    Ch3: Random Network Model
    [ video ]