|
Introduction L1 Maths of Networks L2 Review on Graphs L3 |
Connectivity L4 Eigenvector & Katz L5 Pagerank & HITS L6 |
Closeness & Betweenness Centrality L7 Group of vertices L8 Clustering Coefficient L9 |
|
Signed Networks L10 Homophily L11 Homophily (contd.); Structure of Networks - I L12 |
Structure of Networks - II L13 Assignment I Structure of Networks - II L15 |
Quiz I (13-Feb) Random graphs I L17, L18 |
|
RG:small component L19 RG:path length L20 |
Mid-semester |
Configuration Model L22 Conf. Model - Excess degree L23 Conf. Model - Giant Comp. L24 |
|
Conf. Model - Small Comp L25 Conf. Model - PowerLaw L26 Price and BA Model L27 and L28 |
Extension to PA L29 Simple Modularity/Spectral Modularity L30, L31 |
Bisection method L32 Louvain Algo L33 |
|
Infomap L34 Betweeness-based Method L35 Quiz II (20-Apr) |
Node Embedding GNN |
End-semester |
|
Summer break starts 10-May to 21-July |
||