{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T06:44:00Z","timestamp":1673505840351},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T00:00:00Z","timestamp":1673395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T00:00:00Z","timestamp":1673395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Max Planck Institute for Intelligent Systems"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a method to extract temporal hypergraphs from sequences of 2-dimensional functions obtained as solutions to Optimal Transport problems. We investigate optimality principles exhibited by these solutions from the point of view of hypergraph structures. Discrete properties follow patterns that differ from those characterizing their continuous counterparts. Analyzing these patterns can bring new insights into the studied transportation principles. We also compare these higher-order structures to their network counterparts in terms of standard graph properties. We give evidence that some transportation schemes might benefit from hypernetwork representations. We demonstrate our method on real data by analyzing the properties of hypernetworks extracted from images of real systems.<\/jats:p>","DOI":"10.1007\/s41109-022-00529-0","type":"journal-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T11:07:08Z","timestamp":1673435228000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Convergence properties of optimal transport-based temporal hypergraphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Diego","family":"Baptista","sequence":"first","affiliation":[]},{"given":"Caterina","family":"De Bacco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"issue":"1","key":"529_CR1","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1140\/epjds\/s13688-020-00231-0","volume":"9","author":"SG Aksoy","year":"2020","unstructured":"Aksoy SG, Joslyn C, Marrero CO, Praggastis B, Purvine E (2020) Hypernetwork science via high-order hypergraph walks. EPJ Data Sci 9(1):16","journal-title":"EPJ Data Sci"},{"key":"529_CR2","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.210025","volume":"8","author":"D Baptista","year":"2021","unstructured":"Baptista D, De Bacco C (2021a) Principled network extraction from images. R Soc Open Sci 8:210025","journal-title":"R Soc Open Sci"},{"key":"529_CR3","doi-asserted-by":"crossref","unstructured":"Baptista D, De Bacco C (2021b) Convergence properties of optimal transport-based temporal networks. In: International conference on complex networks and their applications. Springer, pp 578\u2013593","DOI":"10.1007\/978-3-030-93409-5_48"},{"issue":"1","key":"529_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-77064-4","volume":"10","author":"D Baptista","year":"2020","unstructured":"Baptista D, Leite D, Facca E, Putti M, De Bacco C (2020) Network extraction by routing optimization. Sci Rep 10(1):1\u201313","journal-title":"Sci Rep"},{"key":"529_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","volume":"874","author":"F Battiston","year":"2020","unstructured":"Battiston F, Cencetti G, Iacopini I, Latora V, Lucas M, Patania A, Young J-G, Petri G (2020) Networks beyond pairwise interactions: structure and dynamics. Phys Rep 874:1\u201392","journal-title":"Phys Rep"},{"key":"529_CR6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.022308","volume":"101","author":"T Carletti","year":"2020","unstructured":"Carletti T, Battiston F, Cencetti G, Fanelli D (2020) Random walks on hypergraphs. Phys Rev E 101:022308. https:\/\/doi.org\/10.1103\/PhysRevE.101.022308","journal-title":"Phys Rev E"},{"issue":"3","key":"529_CR7","doi-asserted-by":"publisher","DOI":"10.1088\/2632-072X\/ac12bd","volume":"2","author":"S Chowdhary","year":"2021","unstructured":"Chowdhary S, Kumar A, Cencetti G, Iacopini I, Battiston F (2021) Simplicial contagion in temporal higher-order networks. J Phys Complex 2(3):035019","journal-title":"J Phys Complex"},{"key":"529_CR8","unstructured":"Cuturi M (2013) Sinkhorn distances: lightspeed computation of optimal transport. In: Advances in neural information processing systems, vol 26"},{"key":"529_CR9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.023032","volume":"2","author":"GF de Arruda","year":"2020","unstructured":"de Arruda GF, Petri G, Moreno Y (2020) Social contagion models on hypergraphs. Phys Rev Res 2:023032. https:\/\/doi.org\/10.1103\/PhysRevResearch.2.023032","journal-title":"Phys Rev Res"},{"issue":"26","key":"529_CR10","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6463\/aa7326","volume":"50","author":"M Dirnberger","year":"2017","unstructured":"Dirnberger M, Mehlhorn K, Mehlhorn T (2017) Introducing the slime mold graph repository. J Phys D Appl Phys 50(26):264001","journal-title":"J Phys D Appl Phys"},{"key":"529_CR11","volume-title":"Differential equations methods for the Monge\u2013Kantorovich mass transfer problem","author":"LC Evans","year":"1999","unstructured":"Evans LC, Gangbo W (1999) Differential equations methods for the Monge\u2013Kantorovich mass transfer problem, vol 653. American Mathematical Society, Providence"},{"issue":"2","key":"529_CR12","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/16M1098383","volume":"78","author":"E Facca","year":"2018","unstructured":"Facca E, Cardin F, Putti M (2018) Towards a stationary Monge\u2013Kantorovich dynamics: the Physarum polycephalum experience. SIAM J Appl Math 78(2):651\u2013676","journal-title":"SIAM J Appl Math"},{"issue":"68","key":"529_CR13","first-page":"1","volume":"82","author":"E Facca","year":"2020","unstructured":"Facca E, Daneri S, Cardin F, Putti M (2020) Numerical solution of Monge\u2013Kantorovich equations via a dynamic formulation. J Sci Comput 82(68):1\u201326","journal-title":"J Sci Comput"},{"key":"529_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2021.110700","volume":"447","author":"E Facca","year":"2021","unstructured":"Facca E, Cardin F, Putti M (2021) Branching structures emerging from a continuous optimal transport model. J Comput Phys 447:110700","journal-title":"J Comput Phys"},{"key":"529_CR15","first-page":"227","volume":"37","author":"L Kantorovich","year":"1942","unstructured":"Kantorovich L (1942) On the transfer of masses. Dokl Akad Nauk 37:227\u2013229 (in Russian)","journal-title":"Dokl Akad Nauk"},{"key":"529_CR16","unstructured":"Leite D, De\u00a0Bacco C (2022) Revealing the similarity between urban transportation networks and optimal transport-based infrastructures. arXiv:2209.06751"},{"issue":"6803","key":"529_CR17","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1038\/35035159","volume":"407","author":"T Nakagaki","year":"2000","unstructured":"Nakagaki T, Yamada H, T\u00f3th \u00c1 (2000) Maze-solving by an amoeboid organism. Nature 407(6803):470\u2013470","journal-title":"Nature"},{"key":"529_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.032310","volume":"101","author":"L Neuh\u00e4user","year":"2020","unstructured":"Neuh\u00e4user L, Mellor A, Lambiotte R (2020) Multibody interactions and nonlinear consensus dynamics on networked systems. Phys Rev E 101:032310. https:\/\/doi.org\/10.1103\/PhysRevE.101.032310","journal-title":"Phys Rev E"},{"issue":"1","key":"529_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjds\/s13688-017-0104-x","volume":"6","author":"A Patania","year":"2017","unstructured":"Patania A, Vaccarino F, Petri G (2017) Topological analysis of data. EPJ Data Sci 6(1):1\u20136","journal-title":"EPJ Data Sci"},{"issue":"5\u20136","key":"529_CR20","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9 G, Cuturi M et al (2019) Computational optimal transport: With applications to data science. Found Trends Mach Learn 11(5\u20136):355\u2013607","journal-title":"Found Trends Mach Learn"},{"issue":"1","key":"529_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.4171\/IFB\/160","volume":"9","author":"F Santambrogio","year":"2007","unstructured":"Santambrogio F (2007) Optimal channel networks, landscape function and branched transport. Interfaces and Free Boundaries 9(1):149\u2013169","journal-title":"Interfaces and Free Boundaries"},{"key":"529_CR22","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-20828-2","volume-title":"Optimal transport for applied mathematicians","author":"F Santambrogio","year":"2015","unstructured":"Santambrogio F (2015) Optimal transport for applied mathematicians, vol 55. Birk\u00e4user, New York, pp 58\u201363"},{"issue":"2","key":"529_CR23","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1137\/18M1201019","volume":"62","author":"MT Schaub","year":"2020","unstructured":"Schaub MT, Benson AR, Horn P, Lippner G, Jadbabaie A (2020) Random walks on simplicial complexes and the normalized Hodge 1-Laplacian. SIAM Rev 62(2):353\u2013391","journal-title":"SIAM Rev"},{"issue":"1","key":"529_CR24","first-page":"1","volume":"6","author":"D Taylor","year":"2015","unstructured":"Taylor D, Klimm F, Harrington HA, Kram\u00e1r M, Mischaikow K, Porter MA, Mucha PJ (2015) Topological data analysis of contagion maps for examining spreading processes on networks. Nat Commun 6(1):1\u201311","journal-title":"Nat Commun"},{"issue":"4","key":"529_CR25","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.jtbi.2006.07.015","volume":"244","author":"A Tero","year":"2007","unstructured":"Tero A, Kobayashi R, Nakagaki T (2007) A mathematical model for adaptive transport network in path finding by true slime mold. J Theor Biol 244(4):553\u2013564","journal-title":"J Theor Biol"},{"issue":"5964","key":"529_CR26","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1126\/science.1177894","volume":"327","author":"A Tero","year":"2010","unstructured":"Tero A, Takagi S, Saigusa T, Ito K, Bebber DP, Fricker MD, Yumiki K, Kobayashi R, Nakagaki T (2010) Rules for biologically inspired adaptive network design. Science 327(5964):439\u2013442","journal-title":"Science"},{"key":"529_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2009","unstructured":"Villani C (2009) Optimal transport: old and new, vol 338. Springer, Berlin"},{"key":"529_CR28","doi-asserted-by":"crossref","unstructured":"Westendorf C, Gruber C, Grube M (2016) Quantitative comparison of plasmodial networks of different slime molds. In: Proceedings of the 9th EAI international conference on bio-inspired information and communications technologies (formerly BIONETICS), pp 611\u2013612","DOI":"10.4108\/eai.3-12-2015.2262420"},{"issue":"02","key":"529_CR29","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1142\/S021919970300094X","volume":"5","author":"Q Xia","year":"2003","unstructured":"Xia Q (2003) Optimal paths related to transport problems. Commun Contemp Math 5(02):251\u2013279","journal-title":"Commun Contemp Math"},{"issue":"4","key":"529_CR30","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.3934\/dcds.2014.34.1683","volume":"34","author":"Q Xia","year":"2014","unstructured":"Xia Q (2014) On landscape functions associated with transport paths. Discrete Contin Dyn Syst 34(4):1683\u20131700","journal-title":"Discrete Contin Dyn Syst"},{"issue":"6","key":"529_CR31","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1051\/m2an\/2015028","volume":"49","author":"Q Xia","year":"2015","unstructured":"Xia Q (2015) Motivations, ideas and applications of ramified optimal transportation. ESAIM Math Model Numer Anal 49(6):1791\u20131832","journal-title":"ESAIM Math Model Numer Anal"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-022-00529-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-022-00529-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-022-00529-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T11:38:17Z","timestamp":1673437097000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-022-00529-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,11]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["529"],"URL":"https:\/\/doi.org\/10.1007\/s41109-022-00529-0","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,11]]},"assertion":[{"value":"28 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 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":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"3"}}