27.02.2017 Mid-Term project presentation on March 7 & 8, at 18.15. Venue: CSE-107

10.02.2017 Syllabus of Midsem: Topics covered till the last class (Feb 10, Friday)

15.01.2017 Term project choice submission deadline : Jan. 21 EOD (Hard deadline)

15.01.2017 Term project group submission deadline : Jan. 17 EOD (Hard deadline)

04.01.2017 First class: Jan 12, 2017, Thu. Venue: CS 120, Time: 11.00am.

Course outline

General Information

Lectures

Evaluation

Assignments

Overview of Network science, Motivation, Large scale dynamic networks, Challenges of graph theory

Small world effect, transitivity and clustering, degree distribution, scale free networks, maximum degree; network resilience; mixing patterns; degree correlations; community structures; network navigation

Basic concepts of network communities, Modularity, various community finding approaches like Girvan-Newman Algorithm, Spectral Bisection Algorithm, Radicchi Edge Clustering Algorithm (for binary as well as weighted graphs), Wu-Hubermann Algorithm, and Random Walk based Algorithm, Louvain, InfoMap

Poisson random graphs, generalized random graphs, the configuration model, generating functions, power-law degree distribution, directed graph, bipartite graph, degree correlations

Price model, Barabasi & Albert model, other growth models, vertex copying models, Bipartite Network

Percolation theory and network resilience, Epidemiological processes, Cascades and information spread

Homophily, Cohesiveness, Cliques, Clans, Clubs, Plex, Equivalence of ties, Ego-centric networks, Cascade formation and information diffusion in Social media (say Twitter).

Search on networks, exhaustive network search, guided network search, network navigation; network visualization and semantic zooming.

Temporal network, Multilayer networks, Interdependent networks, Controllability of complex networks, Economic and financial network analytics

1. Networks: An Introduction, Oxford University Press, Oxford, 2010.

2. Evolution of Networks, Oxford University Press, Oxford, 2003.

3. The structure and function of complex networks, SIAM Review 45, 167-256, 2003.

4. Statistical mechanics of complex networks, Rev. Mod. Phys., 74(1), 2002.

5. Papers from the ACM and IEEE digital libraries.

Room # : CSE-120

Units : 3-0-0

Credits : 3

Contact : Room #322 (CSE), Phone 82358

Class attendance is mandatory! Any time your attendance falls below 85%, you have 100% chance of being de-registered irrespective of your class performance, CGPA etc!

Mid-sem : 30

End-sem : 40

General reference

1. Introduction (Paper).

2. Network Analysis (Paper1, Paper2, Paper3)

3. Social Cohesivity (Paper1, Paper2, Paper3, Paper4, Paper5)

4. Community Detection (Paper1, Paper2, Paper3, Clique percolation, Wu-Hubermann, Radicchi, Spectral Bisection, K-L, Spectral Bisection, Louvain)

5. Random graph (Paper1, Paper2, Paper3, Paper4)

6. Growth Models (Paper1, Paper2, Fitness model, Paper4)

7. Epidemics and small world models (Paper1, Paper2)

8. Pajek (Manual).