A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Social Network Analysis: Structural Positions and Dynamics

Graduate Depth 86 in the knowledge graph ☐ I know this ☆ Set as goal
4topics build on this
370prerequisites beneath it
See this on the map →
Adjacency Matrix and Spectral BasicsIntroduction to Graph Theory+4 more→→Computational Simulation of Social SystemsSocial Network Analysis
network-analysis centrality structural-holes

Core Idea

Social network analysis models relationships as graphs and examines structural properties: centrality (importance of nodes), clustering (dense subgroups), structural holes (bridging). These properties predict information flow, influence, and resilience. Temporal network analysis adds dynamics.

Explainer

From your work on graph theory and adjacency matrices, you have the formal machinery: actors are nodes, relationships are edges, and the adjacency matrix encodes who is connected to whom. Social network analysis uses this structure to ask: where is this actor positioned relative to others, and what does that position give them? The answer depends on which structural properties you measure, and different measures capture fundamentally different aspects of "importance."

Degree centrality is the simplest: how many direct connections does a node have? A person with many friends has high degree centrality. Betweenness centrality captures something different: how often does this node lie on the shortest path between other pairs of nodes? A person who connects two otherwise-separate friend groups has high betweenness even if they have relatively few connections total. Eigenvector centrality (the concept your eigenvalue knowledge unlocks) asks not just how many connections you have but how well-connected your connections are — being linked to high-centrality nodes amplifies your own centrality. Google's original PageRank algorithm is a direct application of this logic.

Structural holes — Ronald Burt's key contribution — are gaps between dense clusters that are not directly connected. The person who bridges two such clusters occupies a broker position: they control information flow between groups that don't otherwise communicate, giving them an informational and strategic advantage. This is distinct from being highly central within a single dense cluster (what Burt calls closure), which builds trust and social capital of a different kind. Research consistently finds that bridge positions predict career advancement, innovation, and influence — not because brokers are individually superior but because their structural position gives them earlier access to diverse information.

Clustering coefficients measure how densely connected a node's neighbors are to each other. High clustering means you're embedded in a tight-knit group where everyone knows everyone; low clustering means your contacts don't know each other. Temporal network analysis adds a time dimension: edges appear and disappear, and the sequence of connections matters. A rumor that starts at time T1 can only spread through edges that exist at T1 or later — the static graph ignores this. These dynamic properties help explain diffusion of information, disease, and innovation through social systems, connecting structural positions to actual behavioral outcomes like adoption, mobilization, or radicalization.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Vectors in Two Dimensions → Vector Operations: Addition, Subtraction, and Scalar Multiplication → Dot Product (Inner Product in R^n) → Matrix Multiplication → Determinants of 2×2 and 3×3 Matrices → Invertible Matrices and Matrix Inverses → Systems of Linear Equations and Matrix Form → Gaussian Elimination and Row Reduction → Row Echelon Form and Back Substitution → The Standard Matrix of a Linear Transformation → Eigenvalues and Eigenvectors → Adjacency Matrix and Spectral Basics → Social Network Analysis: Structural Positions and Dynamics

Longest path: 87 steps · 370 total prerequisite topics

Prerequisites (6)

Leads To (2)