{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:22:17Z","timestamp":1743038537497,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934125"},{"type":"electronic","value":"9783030934132"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93413-2_66","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"804-815","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Layered Hodge Decomposition for\u00a0Urban Transit Networks"],"prefix":"10.1007","author":[{"given":"Unchitta","family":"Kan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"Ort\u00fazar, J. de D., Willumsen, L.G.: Modelling Transport. Wiley, New Jersey (2011)","DOI":"10.1002\/9781119993308"},{"key":"66_CR2","doi-asserted-by":"publisher","unstructured":"Krylatov, A., Zakharov, V., Tuovinen, T.: Optimization Models and Methods for Equilibrium Traffic Assignment. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-34102-2","DOI":"10.1007\/978-3-030-34102-2"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Barth\u00e9l\u00e9my, M.: The Structure and Dynamics of Cities: Urban Data Analysis and Theoretical Modeling. Cambridge (2016)","DOI":"10.1017\/9781316271377"},{"key":"66_CR4","doi-asserted-by":"publisher","first-page":"6007","DOI":"10.1038\/ncomms7007","volume":"6","author":"T Louail","year":"2015","unstructured":"Louail, T., et al.: Uncovering the spatial structure of mobility networks. Nat. Commun. 6, 6007 (2015)","journal-title":"Nat. Commun."},{"key":"66_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.046103","volume":"79","author":"DO Cajueiro","year":"2009","unstructured":"Cajueiro, D.O.: Optimal navigation in complex networks. Phys. Rev. E 79, 046103 (2009)","journal-title":"Phys. Rev. E"},{"key":"66_CR6","doi-asserted-by":"crossref","unstructured":"Gallotti, R., Porter, M.A., Barth\u00e9l\u00e9my, M.: Lost in transportation: information measures and cognitive limits in multilayer navigation. Sci. Adv. 2(2), e1500445 (2016)","DOI":"10.1126\/sciadv.1500445"},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"Ligthill, M.J., Whitham F.R.S.: On kinetic waves II. A theory of traffic flow on crowded roads. Proc. Royal Soc. Ser A. 229(1178), 317\u2013345 (1995)","DOI":"10.1098\/rspa.1955.0089"},{"key":"66_CR8","first-page":"325","volume":"2","author":"JG Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. Ins. Civil Eng. 2, 325\u2013378 (1952)","journal-title":"Proc. Ins. Civil Eng."},{"key":"66_CR9","volume-title":"Studies in the Economics of Transportation","author":"MJ Beckmann","year":"1956","unstructured":"Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"2","key":"66_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0191-2615(89)90034-9","volume":"23B","author":"H Spiess","year":"1989","unstructured":"Spiess, H., Florian, M.: Optimal strategies: a new assignment model for transit networks. Transp. Res. B 23B(2), 83\u2013102 (1989)","journal-title":"Transp. Res. B"},{"key":"66_CR11","first-page":"491","volume":"30","author":"J De Cea","year":"1989","unstructured":"De Cea, J., Fern\u00e1ndez, J.E.: Transit assignment to minimal routes: an efficient new algorithm. Traffic Eng. Control 30, 491\u2013494 (1989)","journal-title":"Traffic Eng. Control"},{"key":"66_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.physa.2014.02.058","volume":"406","author":"EF Legara","year":"2014","unstructured":"Legara, E.F., Monterola, C., Lee, K.K., Hung, G.G.: Critical capacity, travel time delays and travel time distribution of rapid mass transit systems. Phys. A 406, 100\u2013106 (2014)","journal-title":"Phys. A"},{"issue":"6","key":"66_CR13","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1080\/01441641003744261","volume":"30","author":"Y Liu","year":"2010","unstructured":"Liu, Y., Bunker, J., Ferreira, L.: Transit: users\u2019 route-choice modelling in transit assignment: a review. Transp. Rev. 30(6), 753\u2013769 (2010)","journal-title":"Transp. Rev."},{"issue":"4","key":"66_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0191-2615(87)90029-4","volume":"21B","author":"BN Janson","year":"1987","unstructured":"Janson, B.N., Zozaya-Gorostiza, C.: The problem of cyclic flows in traffic assignment. Transp. Res. B 21B(4), 299\u2013310 (1987)","journal-title":"Transp. Res. B"},{"issue":"2","key":"66_CR15","first-page":"138","volume":"45","author":"S Raveau","year":"2011","unstructured":"Raveau, S., Mu\u00f1oz, J.C., de Grange, L.: A topological route choice model for metro. Transp. Res. A 45(2), 138\u2013147 (2011)","journal-title":"Transp. Res. A"},{"issue":"1","key":"66_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10107-010-0419-x","volume":"127","author":"X Jiang","year":"2011","unstructured":"Jiang, X., Lim, L.-H., Yao, Y., Ye, Y.: Statistical ranking and combinatorial Hodge theory. Math. Program. 127(1), 203\u2013244 (2011)","journal-title":"Math. Program."},{"key":"66_CR17","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/s00454-011-9344-x","volume":"45","author":"V de Silva","year":"2011","unstructured":"de Silva, V., Morozov, D., Vejdemo-Johansson, M.: Persistent Cohomology and Circular Coordinates. Disc. Comput. Geom. 45, 737\u2013759 (2011)","journal-title":"Disc. Comput. Geom."},{"key":"66_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.3389\/fncir.2016.00077","volume":"10","author":"T Haruna","year":"2016","unstructured":"Haruna, T., Fujiki, Y.: Hodge decomposition of information flow on small-world networks. Front. Neural Circuit. 10, 77 (2016)","journal-title":"Front. Neural Circuit."},{"issue":"1","key":"66_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0202-8","volume":"4","author":"Y Kichikawa","year":"2019","unstructured":"Kichikawa, Y., Iyetomi, H., Iino, T., Inoue, H.: Community structure based on circular flow in a large-scale transaction network. Appl. Netw. Sci. 4(1), 1\u201323 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0202-8","journal-title":"Appl. Netw. Sci."},{"key":"66_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84996-290-2","volume-title":"Discrete Calculus: Applied Analysis on Graphs for Computational Science","author":"LJ Grady","year":"2010","unstructured":"Grady, L.J., Polimeni, J.R.: Discrete Calculus: Applied Analysis on Graphs for Computational Science. Springer, Cham (2010)"},{"issue":"3","key":"66_CR21","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1137\/18M1223101","volume":"62","author":"L-H Lim","year":"2020","unstructured":"Lim, L.-H.: Hodge Laplacians on Graphs. SIAM Rev. 62(3), 685\u2013715 (2020)","journal-title":"SIAM Rev."},{"issue":"5","key":"66_CR22","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MCSE.2012.91","volume":"15","author":"JL Johnson","year":"2013","unstructured":"Johnson, J.L., Goldring, T.: Discrete Hodge theory on graphs: a tutorial. Comput. Sci. Eng. 15(5), 42\u201355 (2013)","journal-title":"Comput. Sci. Eng."},{"issue":"2","key":"66_CR23","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"UT Brandes","year":"2008","unstructured":"Brandes, U.T.: On variants of shortest-path betweenness centrality and their generic computation. Soc. Networks. 30(2), 136\u2013145 (2008)","journal-title":"Soc. Networks."}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93413-2_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:31:46Z","timestamp":1682627506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93413-2_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934125","9783030934132"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93413-2_66","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","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"}}]}}