{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:52:54Z","timestamp":1771476774836,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030653507","type":"print"},{"value":"9783030653514","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65351-4_51","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"639-650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Path Homology and Temporal Networks"],"prefix":"10.1007","author":[{"given":"Samir","family":"Chowdhury","sequence":"first","affiliation":[]},{"given":"Steve","family":"Huntsman","sequence":"additional","affiliation":[]},{"given":"Matvey","family":"Yutin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/cplx.20156","volume":"12","author":"D Braha","year":"2006","unstructured":"Braha, D., Bar-Yam, Y.: From centrality to temporary fame: dynamic centrality in complex networks. Complexity 12, 59 (2006)","journal-title":"Complexity"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Braha, D., Bar-Yam, Y.: Time-dependent complex networks: dynamic centrality, dynamic motifs, and cycles of social interactions. In: Gross, T., Sayama, H. (eds.) Adaptive Networks: Theory, Models and Applications. Springer (2009)","DOI":"10.1007\/978-3-642-01284-6_3"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Chowdhury, S., M\u00e9moli, F.: Persistent path homology of directed networks. In: Symposium on Discrete Algorithms (2018)","DOI":"10.1137\/1.9781611975031.75"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Chowdhury, S., et al.: Path homologies of deep feedforward networks. In: IEEE International Conference on Machine Learning and Applications (2019)","DOI":"10.1109\/ICMLA.2019.00181"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s41109-019-0209-1","volume":"4","author":"G Cybenko","year":"2019","unstructured":"Cybenko, G., Huntsman, S.: Analytics for directed contact networks. Appl. Net. Sci. 4, 106 (2019)","journal-title":"Appl. Net. Sci."},{"key":"51_CR6","unstructured":"Dey, T. K., Tianqi, L., Wang, Y.: An efficient algorithm for $$1$$-dimensional (persistent) path homology. In: Symposium on Computational Geometry (2020)"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Frieze, A., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge (2016)","DOI":"10.1017\/CBO9781316339831"},{"key":"51_CR8","volume-title":"Elementary Applied Topology","author":"R Ghrist","year":"2014","unstructured":"Ghrist, R.: Elementary Applied Topology. Createspace, Scotts Valley (2014)"},{"key":"51_CR9","unstructured":"Grigor\u2019yan, A., et al.: Homologies of path complexes and digraphs. arXiv:1207.2834 (2012)"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.4310\/HHA.2014.v16.n1.a16","volume":"16","author":"A Grigor\u2019yan","year":"2014","unstructured":"Grigor\u2019yan, A., Muranov, Yu., Yau, S.-T.: Graphs associated with simplicial complexes. Homology Homotopy Appl. 16, 295 (2014)","journal-title":"Homology Homotopy Appl."},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"619","DOI":"10.4310\/PAMQ.2014.v10.n4.a2","volume":"10","author":"A Grigor\u2019yan","year":"2014","unstructured":"Grigor\u2019yan, A., et al.: Homotopy theory for digraphs. Pure Appl. Math. Quart. 10, 619 (2014)","journal-title":"Pure Appl. Math. Quart."},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"887","DOI":"10.4310\/AJM.2015.v19.n5.a5","volume":"19","author":"A Grigor\u2019yan","year":"2015","unstructured":"Grigor\u2019yan, A., et al.: Cohomology of digraphs and (undirected) graphs. Asian J. Math. 19, 887 (2015)","journal-title":"Asian J. Math."},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"969","DOI":"10.4310\/CAG.2017.v25.n5.a4","volume":"25","author":"A Grigor\u2019yan","year":"2017","unstructured":"Grigor\u2019yan, A., Muranov, Yu., Yau, S.-T.: Homologies of graphs and K\u00fcnneth formulas. Comm. Anal. Geom. 25, 969 (2017)","journal-title":"Comm. Anal. Geom."},{"key":"51_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.4310\/HHA.2018.v20.n2.a9","volume":"20","author":"A Grigor\u2019yan","year":"2018","unstructured":"Grigor\u2019yan, A., et al.: On the path homology theory of digraphs and Eilenberg-Steenrod axioms. Homology Homotopy Appl. 20, 179 (2018)","journal-title":"Homology Homotopy Appl."},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1515\/forum-2018-0015","volume":"30","author":"A Grigor\u2019yan","year":"2018","unstructured":"Grigor\u2019yan, A., et al.: Path homology theory of multigraphs and quivers. Forum Math. 30, 1319 (2018)","journal-title":"Forum Math."},{"key":"51_CR16","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge (2002)"},{"key":"51_CR17","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1140\/epjb\/e2015-60657-4","volume":"88","author":"P Holme","year":"2015","unstructured":"Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88, 234 (2015)","journal-title":"Eur. Phys. J. B"},{"key":"51_CR18","unstructured":"Huntsman, S.: Generalizing cyclomatic complexity via path homology. arXiv:2003.00944 (2020)"},{"key":"51_CR19","unstructured":"Kunegis, J.: The Koblenz network collection. In: Proceedings of the WOW (2013)"},{"key":"51_CR20","unstructured":"Lescovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"51_CR21","unstructured":"Lin, Y., et al.: Weighted path homology of weighted digraphs and persistence. arXiv:1910.09891 (2019)"},{"key":"51_CR22","doi-asserted-by":"crossref","unstructured":"Masuda, N., Lambiotte, R.: A Guide to Temporal Networks. World Scientific (2016)","DOI":"10.1142\/q0033"},{"issue":"5594","key":"51_CR23","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"51_CR24","doi-asserted-by":"crossref","unstructured":"Montoya, L.V., Ma, A., Mondrag\u00f3n, R.J.: Social achievement and centrality in MathOverflow. In: Complex Networks (2013)","DOI":"10.1007\/978-3-642-36844-8_3"},{"key":"51_CR25","doi-asserted-by":"publisher","first-page":"123055","DOI":"10.1088\/1367-2630\/16\/12\/123055","volume":"16","author":"M P\u00f3sfai","year":"2014","unstructured":"P\u00f3sfai, M., H\u00f6vel, P.: Structural controllability of temporal networks. New J. Phys. 16, 123055 (2014)","journal-title":"New J. Phys."},{"key":"51_CR26","unstructured":"Shajii, A.R. (2013). https:\/\/github.com\/arshajii\/digraph-homology"},{"key":"51_CR27","unstructured":"Slawinski, M. (2013). https:\/\/github.com\/gtownrocks\/digraph_homology"},{"key":"51_CR28","doi-asserted-by":"crossref","unstructured":"Tausczik, Y.R., Kittur, A., Kraut, R.E.: Collaborative problem solving: a study of MathOverflow. In: CSCW (2014)","DOI":"10.1145\/2531602.2531690"},{"key":"51_CR29","doi-asserted-by":"crossref","unstructured":"Viswanath, B., et al.: On the evolution of user interaction in Facebook. In: WOSN (2009)","DOI":"10.1145\/1592665.1592675"},{"key":"51_CR30","unstructured":"Yutin, M.: Personal communication (2019)"},{"key":"51_CR31","unstructured":"Yutin, M. (2020). https:\/\/github.com\/SteveHuntsmanBAESystems\/PerformantPathHomology"}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:49:45Z","timestamp":1609800585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_51","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}