Find K-Core Participation Layers
Peel a network by minimum internal degree, record coreness, and distinguish a cohesive participation layer from prestige or causal importance.
Method sources
By the end of this tutorial
- 1Define k-core decomposition and coreness from an explicit node, tie, boundary, direction, weight, and observation-window specification.
- 2Apply and audit this procedure: Iteratively remove nodes with degree below k, assign each node its highest retained k shell, compare shell membership under alternative reply thresholds, and inspect component structure within the maximum core.
- 3Interpret the result with a sensitivity check and the following evidence boundary: High coreness indicates embeddedness under one threshold; it is not identical to leadership, learning quality, rich-club organization, or indispensability.
SNA
Network specification
Analysis scenario
An online learning community wants to identify sustained mutually connected participation without selecting a degree threshold by eye.
Nodes
All students eligible for the online course discussion network during the full semester.
Ties
An undirected binary connection created when either student directly replied to the other at least twice under the pre-registered threshold.
Network type
One-mode, undirected, binary semester network with retained isolates and a documented reply threshold.
Step-by-step tutorial
Freeze the relational question
Write the decision the analysis must inform, then lock the eligible node roster, tie-generating event, direction, weight, self-tie rule, observation window, and missing-data code. Preserve a read-only source copy and record why this specification represents the stated question.
Checkpoint
A second analyst can reconstruct the same node set and edge table from the written rules without guessing what an absent record means.
Compute the focal structure
Work on a versioned analysis copy and carry out the focal method exactly as specified: Iteratively remove nodes with degree below k, assign each node its highest retained k shell, compare shell membership under alternative reply thresholds, and inspect component structure within the maximum core. Save software and package versions, every threshold, normalization, seed, and intermediate count needed to reproduce the result.
Checkpoint
The output is tied to one named data version and includes the denominator, parameter settings, and a reproducible calculation record.
Run a structural sensitivity check
Repeat the analysis under at least one defensible alternative boundary, missingness rule, tie threshold, weight transformation, or model setting. Compare membership and substantive conclusions, not only a single coefficient, and investigate every change large enough to alter a decision.
Checkpoint
The audit states which patterns persist, which actors or groups change classification, and which conclusion depends on an analyst choice.
Report for responsible action
Pair the numerical result with a table or structure-preserving visual, document excluded and missing actors, and explain uncertainty in plain language. Convert the finding into a reversible support question, not an automatic ranking, while stating this boundary: High coreness indicates embeddedness under one threshold; it is not identical to leadership, learning quality, rich-club organization, or indispensability.
Checkpoint
The final note contains the question, specification, result, sensitivity evidence, uncertainty, privacy controls, and a proportionate next step.
Interpret with care
k-core decomposition and coreness describes a property of the specified relation and network boundary. It does not transfer automatically to another relation, time period, class, platform, or population.
High coreness indicates embeddedness under one threshold; it is not identical to leadership, learning quality, rich-club organization, or indispensability. Compare the result with raw counts, missingness, plausible alternative specifications, and contextual evidence before acting.