{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:04:37Z","timestamp":1770746677689,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T00:00:00Z","timestamp":1681344000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T00:00:00Z","timestamp":1681344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"The Information Science and Technology (IST) initiative at Caltech","award":["Carver Mead Discovery Grant"],"award-info":[{"award-number":["Carver Mead Discovery Grant"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Understanding a complex system of relationships between courses is of great importance for the university\u2019s educational mission. This paper is dedicated to the study of course-prerequisite networks (CPNs), where nodes represent courses and directed links represent the formal prerequisite relationships between them. The main goal of CPNs is to model interactions between courses, represent the flow of knowledge in academic curricula, and serve as a key tool for visualizing, analyzing, and optimizing complex curricula. First, we consider several classical centrality measures, discuss their meaning in the context of CPNs, and use them for the identification of important courses. Next, we describe the hierarchical structure of a CPN using the topological stratification of the network. Finally, we perform the interdependence analysis, which allows to quantify the strength of knowledge flow between university divisions and helps to identify the most intradependent, influential, and interdisciplinary areas of study. We discuss how course-prerequisite networks can be used by students, faculty, and administrators for detecting important courses, improving existing and creating new courses, navigating complex curricula, allocating teaching resources, increasing interdisciplinary interactions between departments, revamping curricula, and enhancing the overall students\u2019 learning experience. The proposed methodology can be used for the analysis of any CPN, and it is illustrated with a network of courses taught at the California Institute of Technology. The network data analyzed in this paper is publicly available in the GitHub repository.<\/jats:p>","DOI":"10.1007\/s41109-023-00543-w","type":"journal-article","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T13:02:56Z","timestamp":1681390976000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Course-prerequisite networks for analyzing and understanding academic curricula"],"prefix":"10.1007","volume":"8","author":[{"given":"Pavlos","family":"Stavrinides","sequence":"first","affiliation":[]},{"given":"Konstantin M.","family":"Zuev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,13]]},"reference":[{"key":"543_CR1","unstructured":"Akba\u015f MI, Basavaraj P, Georgiopoulos M, Garibay \u00d6, Garibay I (2015) Curriculum GPS: an adaptive curriculum generation and planning system"},{"issue":"3","key":"543_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1002\/bmb.20861","volume":"43","author":"PR Aldrich","year":"2015","unstructured":"Aldrich PR (2015) The curriculum prerequisite network: modeling the curriculum as a complex system. Biochem Mol Biol Educ 43(3):168\u2013180. https:\/\/doi.org\/10.1002\/bmb.20861","journal-title":"Biochem Mol Biol Educ"},{"key":"543_CR3","unstructured":"Alvarez-Hamelin J, Dall\u2019Asta L, Barrat A, Vespignani A (2005) Large scale networks fingerprinting and visualization using the k-core decomposition. In: Weiss Y, Sch\u00f6lkopf B, Platt J (eds) Advances in neural information processing systems, vol 18"},{"key":"543_CR4","unstructured":"Anthonisse JM (1971) The rush in a directed graph. Technical report BN 9\/71. https:\/\/ir.cwi.nl\/pub\/9791"},{"issue":"5439","key":"543_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"543_CR6","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1103\/PhysRevLett.59.521","volume":"59","author":"L Bombelli","year":"1987","unstructured":"Bombelli L, Lee J, Meyer D, Sorkin RD (1987) Space-time as a causal set. Phys Rev Lett 59:521\u2013524. https:\/\/doi.org\/10.1103\/PhysRevLett.59.521","journal-title":"Phys Rev Lett"},{"issue":"1","key":"543_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1):107\u2013117. https:\/\/doi.org\/10.1016\/S0169-7552(98)00110-X","journal-title":"Comput Netw ISDN Syst"},{"issue":"1","key":"543_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A Broder","year":"2000","unstructured":"Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener J (2000) Graph structure in the web. Comput Netw 33(1):309\u2013320. https:\/\/doi.org\/10.1016\/S1389-1286(00)00083-9","journal-title":"Comput Netw"},{"key":"543_CR9","unstructured":"CaltechCatalog. https:\/\/catalog.caltech.edu\/archive\/2021-22\/"},{"issue":"4","key":"543_CR10","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset A, Shalizi CR, Newman MEJ (2009) Power-law distributions in empirical data. SIAM Rev 51(4):661\u2013703. https:\/\/doi.org\/10.1137\/070710111","journal-title":"SIAM Rev"},{"key":"543_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/b97670","volume-title":"Probabilistic networks and expert systems","author":"RG Cowell","year":"1999","unstructured":"Cowell RG, Dawid AP, Lauritzen SL, Spiegelhalter DJ (1999) Probabilistic networks and expert systems. Springer, New York. https:\/\/doi.org\/10.1007\/b97670"},{"issue":"2","key":"543_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1093\/comnet\/cnt016","volume":"1","author":"P Csermely","year":"2013","unstructured":"Csermely P, London A, Wu L-Y, Uzzi B (2013) Structure and dynamics of core\/periphery networks. J Complex Netw 1(2):93\u2013123","journal-title":"J Complex Netw"},{"key":"543_CR13","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199548927.001.0001","volume-title":"Lectures on complex networks","author":"SN Dorogovtsev","year":"2010","unstructured":"Dorogovtsev SN (2010) Lectures on complex networks. Oxford University Press, Oxford"},{"issue":"20","key":"543_CR14","doi-asserted-by":"publisher","first-page":"12917","DOI":"10.1073\/pnas.192407699","volume":"99","author":"JA Dunne","year":"2002","unstructured":"Dunne JA, Williams RJ, Martinez ND (2002) Food-web structure and network theory: the role of connectance and size. Proc Natl Acad Sci 99(20):12917\u201312922. https:\/\/doi.org\/10.1073\/pnas.192407699","journal-title":"Proc Natl Acad Sci"},{"key":"543_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, crowds, and markets: reasoning about a highly connected world","author":"DA Easley","year":"2010","unstructured":"Easley DA, Kleinberg JM (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, Cambridge"},{"issue":"3","key":"543_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174","journal-title":"Phys Rep"},{"issue":"1","key":"543_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341. https:\/\/doi.org\/10.2307\/3033543","journal-title":"Sociometry"},{"key":"543_CR18","unstructured":"Gephi: the open graph viz platform. https:\/\/gephi.org\/"},{"issue":"12","key":"543_CR19","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"543_CR20","unstructured":"GitHub: a repository with the Caltech CPN data. https:\/\/github.com\/pstavrin\/Course-Prerequisite-Networks"},{"key":"543_CR21","volume-title":"Deep learning","author":"IJ Goodfellow","year":"2016","unstructured":"Goodfellow IJ, Bengio Y, Courville A (2016) Deep learning. MIT Press, Cambridge"},{"key":"543_CR22","doi-asserted-by":"publisher","first-page":"31708","DOI":"10.1038\/srep31708","volume":"6","author":"L H\u00e9bert-Dufresne","year":"2016","unstructured":"H\u00e9bert-Dufresne L, Grochow J, Allard A (2016) Multi-scale structure and topological anomaly detection via a new network statistic: the onion decomposition. Sci Rep 6:31708","journal-title":"Sci Rep"},{"key":"543_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.046111","volume":"72","author":"P Holme","year":"2005","unstructured":"Holme P (2005) Core-periphery organization of complex networks. Phys Rev E 72:046111","journal-title":"Phys Rev E"},{"key":"543_CR24","volume-title":"Information theory, inference and learning algorithms","author":"DJC MacKay","year":"2003","unstructured":"MacKay DJC (2003) Information theory, inference and learning algorithms. Cambridge University Press, Cambridge"},{"issue":"3","key":"543_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1504\/IJNS.2017.083580","volume":"1","author":"N Meghanathan","year":"2017","unstructured":"Meghanathan N (2017) Curriculum network graph: relative contribution of courses. Int J Netw Sci 1(3):223\u2013247. https:\/\/doi.org\/10.1504\/IJNS.2017.083580","journal-title":"Int J Netw Sci"},{"issue":"3","key":"543_CR26","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TLT.2020.2981331","volume":"13","author":"R Molontay","year":"2020","unstructured":"Molontay R, Horv\u00e1th N, Bergmann J, Szekr\u00e9nyes D, Szab\u00f3 M (2020) Characterizing curriculum prerequisite networks by a student flow approach. IEEE Trans Learn Technol 13(3):491\u2013501. https:\/\/doi.org\/10.1109\/TLT.2020.2981331","journal-title":"IEEE Trans Learn Technol"},{"key":"543_CR27","unstructured":"NetworkX: a python package for network analysis. https:\/\/networkx.org\/"},{"key":"543_CR28","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks: an introduction","author":"MEJ Newman","year":"2018","unstructured":"Newman MEJ (2018) Networks: an introduction. Oxford University Press, Oxford"},{"key":"543_CR29","volume-title":"The structure and dynamics of networks","author":"M Newman","year":"2006","unstructured":"Newman M, Barabasi A-L, Watts DJ (2006) The structure and dynamics of networks. Princeton University Press, Princeton"},{"key":"543_CR30","doi-asserted-by":"crossref","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Technical report 1999-66. http:\/\/ilpubs.stanford.edu:8090\/422\/","DOI":"10.1016\/B978-088415228-6.50166-0"},{"issue":"9","key":"543_CR31","first-page":"1082","volume":"56","author":"MA Porter","year":"2009","unstructured":"Porter MA, Onnela J-P, Mucha PJ (2009) Communities in networks. Not Am Math Soc 56(9):1082\u20131097","journal-title":"Not Am Math Soc"},{"key":"543_CR32","doi-asserted-by":"publisher","unstructured":"Radicchi F, Fortunato S, Vespignani A (2012) In: Scharnhorst A, B\u00f6rner K, van\u00a0den Besselaar P (eds) Citation networks, pp 233\u2013257. https:\/\/doi.org\/10.1007\/978-3-642-23068-4","DOI":"10.1007\/978-3-642-23068-4"},{"issue":"1","key":"543_CR33","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/120881683","volume":"74","author":"MP Rombach","year":"2014","unstructured":"Rombach MP, Porter MA, Fowler JH, Mucha PJ (2014) Core-periphery structure in networks. SIAM J Appl Math 74(1):167\u2013190","journal-title":"SIAM J Appl Math"},{"key":"543_CR34","volume-title":"Algorithms","author":"R Sedgewick","year":"2011","unstructured":"Sedgewick R, Wayne K (2011) Algorithms, 4th edn. Addison-Wesley, Boston","edition":"4"},{"issue":"3","key":"543_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0248208","volume":"16","author":"C Simon de Blas","year":"2021","unstructured":"Simon de Blas C, Gomez Gonzalez D, Criado Herrero R (2021) Network analysis: an indispensable tool for curricula design. A real case-study of the degree on mathematics at the URJC in Spain. PLoS ONE 16(3):1\u201321. https:\/\/doi.org\/10.1371\/journal.pone.0248208","journal-title":"PLoS ONE"},{"key":"543_CR36","doi-asserted-by":"publisher","unstructured":"Slim A, Heileman GL, Kozlick J, Abdallah CT (2014) Employing Markov networks on curriculum graphs to predict student performance. In: 2014 13th international conference on machine learning and applications, pp 415\u2013418. https:\/\/doi.org\/10.1109\/ICMLA.2014.74","DOI":"10.1109\/ICMLA.2014.74"},{"key":"543_CR37","doi-asserted-by":"publisher","unstructured":"Slim A, Kozlick J, Heileman GL, Wigdahl J, Abdallah CT (2014) Network analysis of university courses. In: Proceedings of the 23rd international conference on world wide web, pp 713\u2013718. https:\/\/doi.org\/10.1145\/2567948.2579360","DOI":"10.1145\/2567948.2579360"},{"key":"543_CR38","unstructured":"Toposort: a python module that implements topological stratification of directed acyclic graphs. https:\/\/pypi.org\/project\/toposort\/"},{"key":"543_CR39","volume-title":"Complex network analysis in python","author":"D Zinoviev","year":"2018","unstructured":"Zinoviev D (2018) Complex network analysis in python. Pragmatic Bookshelf, Raleigh"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00543-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-023-00543-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-023-00543-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T13:08:02Z","timestamp":1681391282000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-023-00543-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,13]]},"references-count":39,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["543"],"URL":"https:\/\/doi.org\/10.1007\/s41109-023-00543-w","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,13]]},"assertion":[{"value":"7 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"PS is a current senior at the California Institute of Technology majoring in Applied and Computational Mathematics, email: pstavrin@caltech.edu. KZ is a Teaching Professor of Computing and Mathematical Sciences at the California Institute of Technology, .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Authors\u2019 information"}}],"article-number":"19"}}