Studying Networks in Complex Problem Domains: Advancing Methods in Boundary Specification
Bibliographic record
Abstract
The application of network perspectives and methods to study complex problem and policy domains has proliferated in the public management literature.Network metrics are highly sensitive to boundary decisions as findings are a direct reflection of who and what was considered to be part of the network.The more complex the problem domain, the messier the network and the more challenging it is for researchers to determine network boundaries.Laumann, Marsden, and Prensky's seminal (1989) article on network bounding highlighted the theoretical and methodological significance associated with determinations of network boundaries in social network research.However, despite an expansion of network scholarship, the advancement of frameworks aimed at assisting scholars in thinking through the relative advantages and disadvantages of different boundary determinations has received limited attention.This article addresses this gap.Drawing insights from three network studies, we argue that problem domain characteristics and concerns such as formal structures, isolates, disconnected subgroups and/or the duration of the ties will be differentially emphasized with different boundary approaches.We leverage these insights to advance a framework for aiding network scholars working in complex problem domains to consider the strengths and limitations of varied bounding approaches in relation to the question at hand.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.050 | 0.147 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.003 | 0.003 |
| Bibliometrics | 0.010 | 0.010 |
| Science and technology studies | 0.003 | 0.021 |
| Scholarly communication | 0.011 | 0.023 |
| Open science | 0.005 | 0.011 |
| Research integrity | 0.004 | 0.010 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".