MA653    Network Science (3 0 0 6)
Pre-requisites: MA 512    Data Structures and Algorithms or equivalent

Class timings: Tue (08 - 08:55); Wed (09 - 09:55); Thu (10:00 - 10:55)    
Room no: 2101

Syllabus :
Relevant concepts from graph theory - path, connected component, random walk, network types;
Network analysis metrics - clustering, degree correlations, centrality, social network analysis methods.
Properties of networks - scale-free, small world.
Network evolution models - random networks, preferential attachment models and its variants;
Watts & Strogatz model. Community detection methods and real world application of community detection.
Dynamics on networks - percolation, spreading, synchronization and real world applications.
Network analysis tools – Pajek, iGraph
Texts :
1. M.E.J. Newman, Networks, 2nd Edition, Oxford Univ. Press, 2018

References :
1. Albert-László Barabási, Network Science, 1st Edition, Cambridge Univ. Press, 2016.
2. R. Cohen and S. Havlin, Complex Networks - Structure, Robustness and Function, Cambridge Univ Press, 2010.

TA :
Puspanjali Ghoshal (g.puspanjali@iitg.ac.in)