{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T04:26:36Z","timestamp":1691555196315},"reference-count":38,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.380.15","type":"journal-article","created":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T11:58:01Z","timestamp":1690545481000},"page":"254-267","source":"Crossref","is-referenced-by-count":0,"title":["Magnitude and Topological Entropy of Digraphs"],"prefix":"10.4204","volume":"380","author":[{"given":"Steve","family":"Huntsman","sequence":"first","affiliation":[]}],"member":"2720","published-online":{"date-parts":[[2023,8,7]]},"reference":[{"key":"bunch2020practical","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2006.14063","article-title":"Practical applications of metric space magnitude and weighting vectors","author":"Bunch","year":"2020"},{"issue":"4","key":"chowdhury2019gromov","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1093\/imaiai\/iaz026","article-title":"The Gromov\u2013Wasserstein distance between networks and stable network invariants","volume":"8","author":"Chowdhury","year":"2019","journal-title":"Information and Inference"},{"key":"chowdhury2020gromov","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW50498.2020.00429","article-title":"Gromov-Wasserstein averaging in a Riemannian framework","volume-title":"CVPR Workshops","author":"Chowdhury","year":"2020"},{"key":"chowdhury2020generalized","article-title":"Generalized spectral clustering via Gromov-Wasserstein learning","volume-title":"AISTATS","author":"Chowdhury","year":"2021"},{"issue":"3","key":"chuang2016magnitude","first-page":"63","article-title":"On the magnitude of a finite dimensional algebra","volume":"31","author":"Chuang","year":"2016","journal-title":"Theory and Applications of Categories"},{"key":"cooper2011engineering","doi-asserted-by":"publisher","DOI":"10.1016\/C2009-0-27982-7","volume-title":"Engineering a Compiler","author":"Cooper","year":"2011"},{"issue":"3","key":"dorfler1980covers","first-page":"269","article-title":"Covers of digraphs","volume":"30","author":"D\u00f6rfler","year":"1980","journal-title":"Mathematica Slovaca"},{"key":"emmert2016fifty","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ins.2016.01.074","article-title":"Fifty years of graph matching, network alignment and network comparison","volume":"346","author":"Emmert-Streib","year":"2016","journal-title":"Information Sciences"},{"key":"fong2019invitation","doi-asserted-by":"publisher","DOI":"10.1017\/9781108668804","volume-title":"An Invitation to Applied Category Theory: Seven Sketches in Compositionality","author":"Fong","year":"2019"},{"key":"ghrist2014elementary","volume-title":"Elementary Applied Topology","author":"Ghrist","year":"2014"},{"issue":"1","key":"grindrod2013matrix","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1137\/110855715","article-title":"A matrix iteration for dynamic network summaries","volume":"55","author":"Grindrod","year":"2013","journal-title":"SIAM Review"},{"key":"hatcher2002algebraic","volume-title":"Algebraic Topology","author":"Hatcher","year":"2002"},{"key":"heidergott2014max","doi-asserted-by":"publisher","DOI":"10.1515\/9781400865239","volume-title":"Max Plus at Work","author":"Heidergott","year":"2014"},{"key":"huntsman2019multiresolution","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-59533-6_20","article-title":"The multiresolution analysis of flow graphs","volume-title":"WoLLIC","author":"Huntsman","year":"2019"},{"key":"huntsman2022diversity","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2201.10037","article-title":"Diversity enhancement via magnitude","author":"Huntsman","year":"2022"},{"key":"johnson1994program","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178258","article-title":"The program structure tree: computing control regions in linear time","volume-title":"PLDI","author":"Johnson","year":"1994"},{"issue":"8","key":"karam2015growth","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1090\/S0002-9947-2015-06189-3","article-title":"Growth of balls in the universal cover of surfaces and graphs","volume":"367","author":"Karam","year":"2015","journal-title":"Transactions of the American Mathematical Society"},{"key":"kelly1982basic","volume-title":"Basic Concepts of Enriched Category Theory","author":"Kelly","year":"1982"},{"key":"kitchens2012symbolic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58822-8","volume-title":"Symbolic Dynamics","author":"Kitchens","year":"2012"},{"issue":"1","key":"lee2019volume","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-018-36339-7","article-title":"Volume entropy for modeling information flow in a brain graph","volume":"9","author":"Lee","year":"2019","journal-title":"Scientific Reports"},{"issue":"2","key":"leinster2019magnitude","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1017\/S0305004117000810","article-title":"The magnitude of a graph","volume":"166","author":"Leinster","year":"2019","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"leinster2021entropy","doi-asserted-by":"publisher","DOI":"10.1017\/9781108963558","volume-title":"Entropy and Diversity: the Axiomatic Approach","author":"Leinster","year":"2021"},{"key":"leinster2017magnitude","doi-asserted-by":"publisher","DOI":"10.1515\/9783110550832-005","article-title":"The magnitude of a metric space: from category theory to geometric measure theory","volume-title":"Measure Theory in Non-Smooth Spaces","author":"Leinster","year":"2017"},{"issue":"10","key":"lim2008minimal","doi-asserted-by":"publisher","first-page":"5089","DOI":"10.1090\/S0002-9947-08-04227-X","article-title":"Minimal volume entropy for graphs","volume":"360","author":"Lim","year":"2008","journal-title":"Transactions of the American Mathematical Society"},{"key":"mac1978categories","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4721-8","volume-title":"Categories for the working mathematician","author":"Mac Lane","year":"1978"},{"issue":"3","key":"manning1979topological","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/1971239","article-title":"Topological entropy for geodesic flows","volume":"110","author":"Manning","year":"1979","journal-title":"Annals of Mathematics"},{"issue":"4","key":"memoli2011gromov","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","article-title":"Gromov\u2013Wasserstein distances and the metric approach to object matching","volume":"11","author":"M\u00e9moli","year":"2011","journal-title":"Foundations of Computational Mathematics"},{"issue":"3","key":"memoli2014gromov","doi-asserted-by":"publisher","first-page":"335","DOI":"10.3390\/axioms3030335","article-title":"The Gromov\u2013Wasserstein distance: a brief overview","volume":"3","author":"M\u00e9moli","year":"2014","journal-title":"Axioms"},{"key":"mizuno2001zeta","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0024-3795(01)00318-4","article-title":"Zeta functions of digraphs","volume":"336","author":"Mizuno","year":"2001","journal-title":"Linear Algebra and its Applications"},{"key":"nielson2004principles","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"Nielson","year":"2004"},{"key":"sato2020fast","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2002.01615","article-title":"Fast and robust comparison of probability measures in heterogeneous spaces","author":"Sato","year":"2020"},{"issue":"12","key":"selassie2011divided","doi-asserted-by":"publisher","first-page":"2354","DOI":"10.1109\/TVCG.2011.190","article-title":"Divided edge bundling for directional network data","volume":"17","author":"Selassie","year":"2011","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"vayer2019optimal","article-title":"Optimal transport for structured data with application on graphs","volume-title":"ICML","author":"Vayer","year":"2019"},{"issue":"9","key":"vayer2020fused","doi-asserted-by":"publisher","DOI":"10.3390\/a13090212","article-title":"Fused Gromov-Wasserstein distance for structured objects","volume":"13","author":"Vayer","year":"2020","journal-title":"Algorithms"},{"issue":"2","key":"wills2020metrics","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0228728","article-title":"Metrics for graph comparison: a practitioner\u2019s guide","volume":"15","author":"Wills","year":"2020","journal-title":"PLoS ONE"},{"key":"xu2019scalable","article-title":"Scalable Gromov-Wasserstein learning for graph partitioning and matching","volume-title":"NeurIPS","author":"Xu","year":"2019"},{"key":"xu2019gromov","article-title":"Gromov-Wasserstein learning for graph matching and node embedding","volume-title":"ICML","author":"Xu","year":"2019"},{"issue":"4","key":"zhang2004using","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1109\/TSE.2004.1274043","article-title":"Using hammock graphs to structure programs","volume":"30","author":"Zhang","year":"2004","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T18:36:13Z","timestamp":1691519773000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2205.05178v3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,7]]},"references-count":38,"URL":"https:\/\/doi.org\/10.4204\/eptcs.380.15","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,7]]}}}