|
21CSE325T APPLIED_SOCIAL_NETWORK_ANALYSIS Syllabus |
|
|
1 |
Unit-1 - Introduction to Social Network |
|
1.1 |
Basic Network Concepts |
|
1.2 |
Adjacency Matrices, Graphs, and Notation |
|
1.3 |
Nodes and Links |
|
1.4 |
Centrality Measures |
|
1.5 |
What is Centrality and Why Do We Study It? |
|
1.6 |
Calculating Nodal Centrality Measures |
|
1.7 |
Directed Networks and Centrality Measures |
|
1.8 |
Location in the Network |
|
1.9 |
Graph Level Measures - Density, Diameter, Centralization, Average Centralities |
|
1.10 |
Network Topology |
|
1.11 |
T1: Introduction to networkx |
|
1.12 |
T2: Finding connectedness of a graph |
|
1.13 |
T3: Implementation of centrality measures |
|
2 |
Unit-2 - SNA Algorithms |
|
2.1 |
SNA Algorithms - Introduction |
|
2.2 |
Node Assortativity Coefficients & Correlation Measures |
|
2.3 |
Directed Acyclic Graphs (DAGs) |
|
2.4 |
Topological Sort |
|
2.5 |
Dinitz’s Algorithm & its Applications |
|
2.6 |
Euler’s Algorithm |
|
2.7 |
Graph Generators |
|
2.8 |
Geometric Generator Models |
|
2.9 |
Sudoku, and Graph coloring. |
|
2.10 |
T4: Calculate the assortativity coefficient |
|
2.11 |
T5: Implement programs for Directed Acyclic Graphs & Topological Sort |
|
2.12 |
T6: Implement Maximum flow problem |
|
3 |
Unit-3 - Establishing Stable Networks |
|
3.1 |
Exploring Social Networking Data Sets |
|
3.2 |
Establishing a Social Network |
|
3.3 |
Connectivity of Users in Social Networks |
|
3.4 |
Case Study of Facebook |
|
3.5 |
Signed Networks |
|
3.6 |
Unstable network to stable network |
|
3.7 |
T7: Code to find unstable network |
|
3.8 |
T8: Find the number of unstable triangles |
|
3.9 |
T9: Solution to convert unstable into stable network |
|
4 |
Unit-4 - Communities in the Network |
|
4.1 |
Community Detection |
|
4.2 |
Strength of Weak Ties |
|
4.3 |
Triadic Closure |
|
4.4 |
Detecting Communities in a Network |
|
4.5 |
Girvan-Newman Algorithm Modularity |
|
4.6 |
Minimum Cut Trees |
|
4.7 |
Tie Strengths in Mobile Communication Network |
|
4.8 |
Exact Betweenness Centrality |
|
4.9 |
T10: Detect the communities in the graph |
|
4.10 |
T11: Code for Triadic Closure |
|
4.11 |
T12: Explore the strong and weak ties in the network |
|
5 |
Unit-5 - Link Analysis in Web |
|
5.1 |
The Structure of the Web |
|
5.2 |
The World Wide Web |
|
5.3 |
Information Networks |
|
5.4 |
Hypertext and Associative Memory |
|
5.5 |
The Web as a Directed Graph |
|
5.6 |
The Bow-Tie Structure of the Web |
|
5.7 |
The Emergence of Web - Link Analysis and Web Search |
|
5.8 |
Searching the Web - The Problem of Ranking |
|
5.9 |
Link Analysis Using Hubs and Authorities |
|
5.10 |
PageRank |
|
5.11 |
Applying Link Analysis in Modern Web Search |
|
5.12 |
Power Law |
|
5.13 |
T13: Implement points distribution method |
|
5.14 |
T14: Code for random walk method |
|
5.15 |
T15: Explore the tools related to SNA |