{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T14:38:56Z","timestamp":1777041536546,"version":"3.51.4"},"reference-count":38,"publisher":"Cambridge University Press (CUP)","license":[{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"unspecified","delay-in-days":306,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Net Sci"],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Course-prerequisite networks (CPNs) are directed acyclic graphs that model complex academic curricula by representing courses as nodes and dependencies between them as directed links. These networks are indispensable tools for visualizing, studying, and understanding curricula. For example, CPNs can be used to detect important courses, improve advising, guide curriculum design, analyze graduation time distributions, and quantify the strength of knowledge flow between different university departments. However, most CPN analyses to date have focused only on micro- and meso-scale properties. To fill this gap, we define and study three new global CPN measures: breadth, depth, and flux. All three measures are invariant under transitive reduction and are based on the concept of topological stratification, which generalizes topological ordering in directed acyclic graphs. These measures can be used for macro-scale comparison of different CPNs. We illustrate the new measures numerically by applying them to three real and synthetic CPNs from three universities: the Cyprus University of Technology, the California Institute of Technology, and Johns Hopkins University. The CPN data analyzed in this paper are publicly available in a GitHub repository.<\/jats:p>","DOI":"10.1017\/nws.2025.10013","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T09:31:08Z","timestamp":1762162268000},"source":"Crossref","is-referenced-by-count":1,"title":["Breadth, depth, and flux of course-prerequisite networks"],"prefix":"10.1017","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2174-700X","authenticated-orcid":false,"given":"Konstantin M.","family":"Zuev","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05dxps055","id-type":"ROR","asserted-by":"publisher"}],"name":"California Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlos","family":"Stavrinides","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2025,11,3]]},"reference":[{"key":"S2050124225100131_ref24","doi-asserted-by":"publisher","DOI":"10.2307\/2937047"},{"key":"S2050124225100131_ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-023-00543-w"},{"key":"S2050124225100131_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"S2050124225100131_ref8","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnt016"},{"key":"S2050124225100131_ref23","doi-asserted-by":"publisher","DOI":"10.1098\/rsbl.2003.0057"},{"key":"S2050124225100131_ref13","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"S2050124225100131_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-024-00637-z"},{"key":"S2050124225100131_ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-08872-4"},{"key":"S2050124225100131_ref4","doi-asserted-by":"publisher","DOI":"10.1063\/1.3077229"},{"key":"S2050124225100131_ref31","first-page":"233","volume-title":"Citation Networks","author":"Radicchi","year":"2012"},{"key":"S2050124225100131_ref32","doi-asserted-by":"publisher","DOI":"10.1137\/120881683"},{"key":"S2050124225100131_ref10","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199548927.001.0001"},{"key":"S2050124225100131_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"S2050124225100131_ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.102.128701"},{"key":"S2050124225100131_ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TLT.2020.2981331"},{"key":"S2050124225100131_ref27","volume-title":"The Structure and Dynamics of Networks","author":"Newman","year":"2006"},{"key":"S2050124225100131_ref35","doi-asserted-by":"crossref","unstructured":"Slim, A. , Kozlick, J. , Heileman, G. L. , Wigdahl, J. , & Abdallah, C. T. (2014). Network analysis of university courses. In: Proceedings of the 23rd International Conference on World Wide Web (pp. 713\u2013718).","DOI":"10.1145\/2567948.2579360"},{"key":"S2050124225100131_ref21","doi-asserted-by":"publisher","DOI":"10.3389\/fncom.2014.00114"},{"key":"S2050124225100131_ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.192407699"},{"key":"S2050124225100131_ref30","first-page":"1082","article-title":"Communities in networks","volume":"56","author":"Porter","year":"2009","journal-title":"Notices of the American Mathematical Society"},{"key":"S2050124225100131_ref14","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"S2050124225100131_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(80)80030-8"},{"key":"S2050124225100131_ref3","volume-title":"Advances in Neural Information Processing Systems","volume":"18","author":"Alvarez-Hamelin","year":"2005"},{"key":"S2050124225100131_ref34","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0248208"},{"key":"S2050124225100131_ref26","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"key":"S2050124225100131_ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.046111"},{"key":"S2050124225100131_ref33","volume-title":"Algorithms","author":"Sedgewick","year":"2011"},{"key":"S2050124225100131_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942"},{"key":"S2050124225100131_ref38","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"S2050124225100131_ref22","doi-asserted-by":"publisher","DOI":"10.1038\/srep00793"},{"key":"S2050124225100131_ref6","doi-asserted-by":"publisher","DOI":"10.1126\/science.1165821"},{"key":"S2050124225100131_ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0201008"},{"key":"S2050124225100131_ref18","doi-asserted-by":"publisher","DOI":"10.1038\/35075138"},{"key":"S2050124225100131_ref16","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"S2050124225100131_ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511610905"},{"key":"S2050124225100131_ref2","doi-asserted-by":"publisher","DOI":"10.1002\/bmb.20861"},{"key":"S2050124225100131_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.01.023"},{"key":"S2050124225100131_ref20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.046110"}],"container-title":["Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S2050124225100131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T09:31:09Z","timestamp":1762162269000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S2050124225100131\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":38,"alternative-id":["S2050124225100131"],"URL":"https:\/\/doi.org\/10.1017\/nws.2025.10013","relation":{},"ISSN":["2050-1242","2050-1250"],"issn-type":[{"value":"2050-1242","type":"print"},{"value":"2050-1250","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"article-number":"e17"}}