The Topology of Hardship: Empirical Curriculum Graphs and Structural Bottlenecks in Engineering Degrees
H. R. Paz

TL;DR
This paper introduces a novel empirical approach to quantify the structural complexity of engineering curricula by analyzing student trajectories and network topology, revealing how certain bottlenecks correlate with dropout and delays.
Contribution
It develops a new framework combining empirical student data with network analysis to measure curriculum hardness as a topological property, informing reform and policy.
Findings
Curriculum hardness correlates with dropout rates.
Bottleneck-heavy curricula show higher dropout and delays.
Structural metrics predict student progression issues.
Abstract
Engineering degrees are often perceived as "hard", yet this hardness is usually discussed in terms of content difficulty or student weaknesses rather than as a structural property of the curriculum itself. Recent work on course-prerequisite networks and curriculum graphs has shown that study plans can be modelled as complex networks with identifiable hubs and bottlenecks, but most studies rely on official syllabi rather than on how students actually progress through the system (Simon de Blas et al., 2021; Stavrinides & Zuev, 2023; Yang et al., 2024; Wang et al., 2025). This paper introduces the notion of topology of hardship: a quantitative description of curriculum complexity derived from empirical student trajectories in long-cycle engineering programmes. Building on the CAPIRE framework for multilevel trajectory modelling (Paz, 2025a, 2025b), we reconstruct degree-curriculum graphs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEducational Theory and Curriculum Studies · Mathematics Education and Programs · Online Learning and Analytics
