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 moreComputational 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionSine, Cosine, and Tangent RatiosTrigonometric Ratios ReviewVectors in Two DimensionsVector Operations: Addition, Subtraction, and Scalar MultiplicationDot Product (Inner Product in R^n)Matrix MultiplicationDeterminants of 2×2 and 3×3 MatricesInvertible Matrices and Matrix InversesSystems of Linear Equations and Matrix FormGaussian Elimination and Row ReductionRow Echelon Form and Back SubstitutionThe Standard Matrix of a Linear TransformationEigenvalues and EigenvectorsAdjacency Matrix and Spectral BasicsSocial Network Analysis: Structural Positions and Dynamics

Longest path: 87 steps · 370 total prerequisite topics

Prerequisites (6)

Leads To (2)