Let’s be honest: when most people hear “Social Networks,” they think of scrolling through feeds or posting photos. But Social Network Analysis (SNA) is the rigorous, mathematical study of how information, influence, and even diseases flow through a population. It is the unit that turns “friendships” into “nodes” and “interactions” into “edges.” It is the science of seeing the invisible structures that dictate who has power and who is isolated.
Below is the exam paper download link
Pdf Past Paper On Social Network Analysis For Revision
Above is the exam paper download link
If you’re preparing for your finals, you’ve likely realized that this unit is a fascinating mix of graph theory and sociology. One minute you’re calculating the Clustering Coefficient of a tight-knit community, and the next you’re trying to identify the “Bridge” that connects two completely different worlds. It is a subject that requires a “structural” brain—one that understands that who you know is often less important than where you sit in the network.
To help you get into the “Network Scientist” mindset, we’ve tackled the high-yield questions that define the syllabus. Plus, we’ve provided a direct link to download a full Social Network Analysis revision past paper PDF at the bottom of this page.
Your Revision Guide: The Questions That Define the Graph
Q: What is the difference between “Degree Centrality” and “Betweenness Centrality”? In an exam, this is the bread and butter of SNA. Degree Centrality is simple: it’s the number of direct connections a node has (the “popular” kid). Betweenness Centrality is more subtle: it measures how often a node acts as a bridge along the shortest path between others. A person with high betweenness might not have many friends, but they control the flow of information between groups.
Q: What is the “Small World” Phenomenon (Six Degrees of Separation)? This is the idea that even in a massive network, any two nodes are connected by a surprisingly short path. In your revision, look for the “Watts-Strogatz” model. It explains how a few “random” long-distance connections can shrink the diameter of an entire global network. If a past paper asks why a rumor spreads so fast across a city, the Small World ehttps://mpyanews.com/pastpapers/download-past-paper-on-geography-of-natural-hazards-for-revision/ffect is your answer.
Q: How do you identify a “Community” within a larger network? Community detection is about finding groups of nodes that are more densely connected to each other than to the rest of the network. Examiners often ask about Modularity—a score that measures the strength of this division. If you’re asked to analyze a political network, you’ll likely use community detection to see how “echo chambers” are formed.
Q: What is the “Strength of Weak Ties”? Proposed by Mark Granovetter, this theory suggests that your “weak” acquaintances are often more valuable for finding new information or jobs than your “strong” close friends. Why? Because close friends move in the same circles as you, while weak ties act as bridges to entirely new networks. If a question asks about innovation or job seeking, start with weak ties.
Strategy: How to Use the Past Paper for Maximum Gain
Don’t just read the definitions; trace the paths. If you want to move from a passing grade to an A, follow this “Network Protocol”:
-
The Adjacency Matrix Drill: Take a small graph from the past paper and practice turning it into an Adjacency Matrix (the 1s and 0s that a computer sees). If you can’t build the matrix by hand, you won’t understand how algorithms like PageRank actually calculate influence.
-
The Visual Audit: Look at a network visualization in the past paper. Practice identifying Cliques (where everyone knows everyone) versus Structural Holes (gaps in the network that a savvy entrepreneur might fill).
-
The Logic Check: Be ready to discuss Homophily—the tendency of individuals to associate with others who are similar to them (“birds of a feather”). How does this affect the robustness of a network?
Ready to Decode the Connections?
Social Network Analysis is a discipline of absolute logic and deep human insight. It is the art of mapping the heartbeat of society. By working through a past paper, you’ll start to see the recurring patterns—the specific ways that network density, centrality, and information diffusion are tested year after year.
We’ve curated a comprehensive revision paper that covers everything from Directed vs. Undirected graphs to Erdos-Renyi models and Triadic Closure.
Last updated on: March 18, 2026