Syllabus
|
Course Code: OE Elective-III OE-CS-406 Course Name: Social Networks Analysis & Mining |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Introduction to Social Networks, Google Page Rank, Link Prediction, Importance of Acquaintances, Web Graph, Introduction: Emergence of Connectedness, Granovetter's Strength of weak ties, Triads, clustering coefficient and neighborhood overlap, Structure of weak ties, bridges, and local bridges, Emeddedness, Betweenness Measures and Graph Partitioning, Finding Communities in a graph (Brute Force Method), Community Detection Using Girvan Newman Algorithm, Strong and Weak Relationship | |
| 2 | Introduction to Homophily, Selection and Social Influence, Foci Closure and Membership Closure, Introduction to Fatman Evolutionary model, Triadic Closure, Spatial Segregation: An Introduction, Schelling Model Implementation, Positive and Negative Relationships – Introduction, Structural Balance, Creating graph, displaying it and counting unstable triangles, Equal Coin Distribution, Random Walk Coin Distribution. | |
| 3 | Metrics in social network analysis (Betweenness, Centrality, Equivalence relation, Centralization, Clustering coefficient and Structural cohesion), Diffusion in Networks, Impact of Communities on Diffusion, Cascade and Clusters, Introduction to Hubs and Authorities, Hubs and Authorities, PageRank as a Matrix Operation, Introduction to Power Law, Rich Get Richer Phenomenon, Implementing a Random Graph (Erdos-Renyi Model) | |
| 4 | Rich Get Richer - The Long Tail, Epidemics- An Introduction, Simple Branching Process for Modeling Epidemics, Basic reproductive number, SIR and SIS spreading models, Percolation model, Milgram's Experiment, The Generative Model, Decentralized Search, Basic of Equivalence concepts in Social Networks. | |
