IIT Ropar · Computer Science

Social Networks

Prof. Sudarshan Iyengar · 2025 · 166 free video lectures

The world has become highly interconnected and hence more complex than ever before. We are surrounded by a multitude of networks in our daily life, for example, friendship networks, online social networks, world wide web, road networks etc. All these networks are today available online in the form…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 01 - Introduction (9 min)
  2. Lecture 02 - Answer to the puzzle (6 min)
  3. Lecture 03 - Introduction to Python-1 (21 min)
  4. Lecture 04 - Introduction to Python-2 (28 min)
  5. Lecture 05 - Introduction to Networkx-1 (10 min)
  6. Lecture 06 - Introduction to Networkx-2 (45 min)
  7. Lecture 07 - Social Networks: The Challenge (4 min)
  8. Lecture 08 - Google Page Rank (2 min)
  9. Lecture 09 - Searching in a Network (2 min)
  10. Lecture 10 - Link Prediction (2 min)
  11. Lecture 11 - The Contagions (2 min)
  12. Lecture 12 - Importance of Acquaintances (1 min)
  13. Lecture 13 - Marketing on Social Networks (2 min)
  14. Lecture 14 - Introduction to Datasets
  15. Lecture 15 - Ingredients Network
  16. Lecture 16 - Synonymy Network
  17. Lecture 17 - Web Graph
  18. Lecture 18 - Social Network Datasets
  19. Lecture 19 - Datasets: Different Formats
  20. Lecture 20 - Datasets: How to Download?
  21. Lecture 21 - Datasets: Analysing Using Networkx
  22. Lecture 22 - Datasets: Analysing Using Gephi
  23. Lecture 23 - Introduction : Emergence of Connectedness
  24. Lecture 24 - Advanced Material : Emergence of Connectedness
  25. Lecture 25 -Programming Illustration : Emergence of Connectedness
  26. Lecture 26 - Summary to Datasets
  27. Lecture 27 - Introduction
  28. Lecture 28 - Granovetter's Strength of weak ties
  29. Lecture 29 - Triads, clustering coefficient and neighborhood overlap
  30. Lecture 30 - Structure of weak ties, bridges, and local bridges
  31. Lecture 31 - Validation of Granovetter's experiment using cell phone data
  32. Lecture 32 - Emeddedness
  33. Lecture 33 - Structural Holes
  34. Lecture 34 - Social Capital
  35. Lecture 35 - Tie Strength, Social Media and Passive Engagement
  36. Lecture 36 - Betweenness Measures and Graph Partitioning
  37. Lecture 37 - Finding Communities in a graph (Brute Force Method) - 1
  38. Lecture 38 - Community Detection Using Girvan Newman Algorithm
  39. Lecture 39 - Visualising Communities using Gephi
  40. Lecture 40 - Strong and Weak Relationship - Summary
  41. Lecture 41 - Introduction to Homophily - Should you watch your company ?
  42. Lecture 42 - Selection and Social Influence
  43. Lecture 43 - Interplay between Selection and Social Influence
  44. Lecture 44 - Homophily - Definition and measurement
  45. Lecture 45 - Foci Closure and Membership Closure
  46. Lecture 46 - Introduction to Fatman Evolutionary model
  47. Lecture 47 - Fatman Evolutionary Model- The Base Code (Adding people)
  48. Lecture 48 - Fatman Evolutionary Model- The Base Code (Adding Social Foci)
  49. Lecture 49 - Fatman Evolutionary Model- Implementing Homophily
  50. Lecture 50 - Quantifying the Effect of Triadic Closure
  51. Lecture 51 - Fatman Evolutionary Model- Implementing Closures
  52. Lecture 52 - Fatman Evolutionary Model- Implementing Social Influence
  53. Lecture 53 - Fatman Evolutionary Model- Storing and analyzing longitudnal data
  54. Lecture-54: Spatial Segregation: An Introduction
  55. Lecture55- Spatial Segregation: Simulation of the Schelling Model
  56. Lecture56- Spatial Segregation: Conclusion
  57. Lecture 57- Schelling Model Implementation-1(Introduction)
  58. Lecture 58- Schelling Model Implementation-2 (Base Code)
  59. Lecture 59- Schelling Model Implementation- Visualization and Getting a list of boundary and internal nodes
  60. Lecture 60- Schelling Model Implementation - Getting a list of unsatisfied nodes
  61. Lecture 61- Schelling Model Implementation - Shifting the unsatisfied nodes and visualizing the final graph
  62. Lecture 62- Positive and Negative Relationships - Introduction
  63. Lecture 63- Structural Balance
  64. Lecture 64- Enemy's Enemy is a Friend
  65. Lecture 65- Characterizing the structure of balanced networks
  66. Lecture 66- Balance Theorem
  67. Lecture 67- Proof of Balance Theorem
  68. Lecture 68- Introduction to positive and negative edges
  69. Lecture 69- Outline of Implemantation
  70. Lecture 70- Creating graph, displaying it and counting unstable triangles
  71. Lecture 71- Moving a network from an unstable to stable state
  72. Lecture 72- Forming two coalitions
  73. Lecture 73- Forming two coalitions (Continued)
  74. Lecture 74- Visualizing coalitions and the evolution
  75. Lecture 75: The Web Graph
  76. Lecture 76: Collecting the Web Graph
  77. Lecture 77: Equal Coin Distribution
  78. Lecture 78: Random Walk Coin Distribution
  79. Lecture 79: Google Page Ranking Using Web Graph
  80. Lecture 80: Implementing PageRank Using Points Distribution Method-1
  81. Lecture 81: Implementing PageRank Using Points Distribution Method-2
  82. Lecture 82: Implementing PageRank Using Points Distribution Method-3
  83. Lecture 83: Implementing PageRank Using Points Distribution Method-4
  84. Lecture 84: Implementing PageRank Using Random Walk Method -1
  85. Lecture 85: Implementing PageRank Using Random Walk Method -2
  86. Lecture 86: DegreeRank versus PageRank
  87. Lecture 87 - We Follow
  88. Lecture 88 - Why do we Follow?
  89. Lecture 89 - Diffusion in Networks
  90. Lecture 90 - Modeling Diffusion
  91. Lecture 91- Modeling Diffusion (Continued)
  92. Lecture 92 - Impact of Commmunities on Diffusion
  93. Lecture 93 - Cascade and Clusters
  94. Lecture 94 - Knowledge, Thresholds and the Collective Action
  95. Lecture 95 - An Introduction to the Programming Screencast (Coding 4 major ideas)
  96. Lecture 96 - The Base Code
  97. Lecture 97 - Coding the First Big Idea - Increasing the Payoff
  98. Lecture 98 - Coding the Second Big Idea - Key People
  99. Lecture 99 - Coding the Third Big Idea- Impact of Communities on Cascades
  100. Lecture 100 - Coding the Fourth Big Idea - Cascades and Clusters
  101. Lecture 101 : Introduction to Hubs and Authorities (A Story)
  102. Lecture 102: Principle of Repeated Improvement (A story)
  103. Lecture 103: Principle of Repeated Improvement (An example)
  104. Lecture 104 : Hubs and Authorities
  105. Lecture 105 : PageRank Revisited - An example
  106. Lecture 106: PageRank Revisited - Convergence in the Example
  107. Lecture 107 : PageRank Revisited - Conservation and Convergence
  108. Lecture 108: PageRank, conservation and convergence - Another example
  109. Lecture 109 : Matrix Multiplication (Pre-requisite 1)
  110. Lecture 110: Convergence in Repeated Matrix Multiplication (Pre-requisite 1)
  111. Lecture 111 : Addition of Two Vectors (Pre-requisite 2)
  112. Lecture 112 : Convergence in Repeated Matrix Multiplication- The Details
  113. Lecture 113 : PageRank as a Matrix Operation
  114. Lecture 114 : PageRank Explained
  115. Lecture 115 - Introduction to Power Law
  116. Lecture 116 - Why do Normal Distributions Appear?
  117. Lecture 117 - Power Law emerges in WWW graphs
  118. Lecture 118 - Detecting the Presence of Power Law
  119. Lecture 119 - Rich Get Richer Phenomenon
  120. Leture 120 - Summary So Far
  121. Lecture 121 - Implementing Rich-getting-richer Phenomenon (Barabasi-Albert Model)-1
  122. Lecture 122 - Implementing Rich-getting-richer Phenomenon (Barabasi-Albert Model)-2
  123. Lecture 123 - Implementing a Random Graph (Erdos- Renyi Model)-1
  124. Leture 124 - Implementing a Random Graph (Erdos- Renyi Model)-2
  125. Lecture 125 - Forced Versus Random Removal of Nodes (Attack Survivability)
  126. Lecture 126 - Rich Get Richer - A Possible Reason
  127. Lecture 127 - Rich Get Richer - The Long Tail
  128. Lecture 128 - Epidemics- An Introduction
  129. Lecture 129 - Introduction to epidemics (contd..)
  130. Lecture 130 - Simple Branching Process for Modeling Epidemics
  131. Lecture 131 - Simple Branching Process for Modeling Epidemics (contd..)
  132. Lecture 132- Basic reproductive number
  133. Lecture 133- Modeling epidemics on complex networks
  134. Lecture 134 - SIR and SIS spreading models
  135. Lecture 135 - Comparison between SIR and SIS spreading models
  136. Lecture 136 - Basic Reproductive Number Revisited for Complex Networks
  137. Lecture 137 - Percolation model
  138. Lecture 138 - Analysis of basic reproductive number in branching model (The problem statement)
  139. Lecture 139 - Analyzing basic reproductive number 2
  140. Lecture 140 - Analyzing basic reproductive number (3)
  141. Lecture 141 - Analyzing basic reproductive number (4)
  142. Lecture 142 - Analyzing basic reproductive number (5)
  143. Lecture 143 - Introduction
  144. Lecture 144 : Milgram's Experiment
  145. Lecture 145 : The Reason
  146. Lecture 146: The Generative Model
  147. Lecture 147 : Decentralized Search - I
  148. Lecture 148 : Decentralized Search - II
  149. Lecture 149 : Decentralized Search - III
  150. Lecture 150 : Programming illustration- Small world networks : Introduction
  151. Lecture 151 : Base code
  152. Lecture 152 : Making homophily based edges
  153. Lecture 153 : Adding weak ties
  154. Lecture 154 : Plotting change in diameter
  155. Lecture 155 : Programming illustration- Myopic Search : Introduction
  156. Lecture 156 : Myopic Search
  157. Lecture 157 : Myopic Search comparision to optimal search
  158. Lecture 158 : Time Taken by Myopic Search
  159. Lecture 159 : PseudoCores : Introduction
  160. Lecture 160 : How to be Viral
  161. Lecture 161 : Who are the right key nodes?
  162. Lecture 162 : finding the right key nodes (the core)
  163. Lecture 163 : Coding K-Shell Decomposition
  164. Lecture 164 : Coding cascading Model
  165. Lecture 165 : Coding the importance of core nodes in cascading
  166. Lecture 166 : Pseudo core

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Ropar.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights